/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:45:16,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:45:16,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:45:16,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:45:16,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:45:16,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:45:16,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:45:16,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:45:16,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:45:16,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:45:16,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:45:16,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:45:16,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:45:16,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:45:16,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:45:16,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:45:16,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:45:16,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:45:16,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:45:16,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:45:16,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:45:16,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:45:16,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:45:16,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:45:16,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:45:16,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:45:16,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:45:16,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:45:16,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:45:16,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:45:16,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:45:16,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:45:16,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:45:16,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:45:16,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:45:16,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:45:16,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:45:16,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:45:16,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:45:16,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:45:16,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:45:16,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:45:17,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:45:17,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:45:17,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:45:17,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:45:17,016 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:45:17,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:45:17,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:45:17,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:45:17,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:45:17,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:45:17,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:45:17,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:45:17,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:45:17,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:45:17,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:45:17,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:45:17,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:45:17,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:45:17,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:45:17,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:45:17,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:45:17,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:45:17,020 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:45:17,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:45:17,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:45:17,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:45:17,360 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:45:17,360 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:45:17,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-12-13 03:45:18,473 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:45:18,707 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:45:18,708 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-trans.wvr.c [2022-12-13 03:45:18,717 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0824ebbd/99330c0a09f544cba8482af1eeec8fde/FLAGfd4e6886a [2022-12-13 03:45:18,739 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0824ebbd/99330c0a09f544cba8482af1eeec8fde [2022-12-13 03:45:18,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:45:18,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:45:18,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:45:18,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:45:18,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:45:18,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:45:18" (1/1) ... [2022-12-13 03:45:18,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae469d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:18, skipping insertion in model container [2022-12-13 03:45:18,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:45:18" (1/1) ... [2022-12-13 03:45:18,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:45:18,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:45:18,987 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/chl-array-int-trans.wvr.c[2728,2741] [2022-12-13 03:45:19,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:45:19,012 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:45:19,038 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/chl-array-int-trans.wvr.c[2728,2741] [2022-12-13 03:45:19,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:45:19,055 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:45:19,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19 WrapperNode [2022-12-13 03:45:19,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:45:19,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:45:19,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:45:19,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:45:19,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,119 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 13, calls inlined = 21, statements flattened = 277 [2022-12-13 03:45:19,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:45:19,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:45:19,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:45:19,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:45:19,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:45:19,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:45:19,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:45:19,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:45:19,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (1/1) ... [2022-12-13 03:45:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:45:19,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:19,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:45:19,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:45:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:45:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:45:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:45:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:45:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 03:45:19,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 03:45:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 03:45:19,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 03:45:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 03:45:19,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 03:45:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:45:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 03:45:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:45:19,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:45:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:45:19,226 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:45:19,366 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:45:19,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:45:19,811 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:45:19,821 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:45:19,821 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 03:45:19,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:45:19 BoogieIcfgContainer [2022-12-13 03:45:19,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:45:19,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:45:19,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:45:19,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:45:19,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:45:18" (1/3) ... [2022-12-13 03:45:19,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c8ee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:45:19, skipping insertion in model container [2022-12-13 03:45:19,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:45:19" (2/3) ... [2022-12-13 03:45:19,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c8ee57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:45:19, skipping insertion in model container [2022-12-13 03:45:19,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:45:19" (3/3) ... [2022-12-13 03:45:19,833 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2022-12-13 03:45:19,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:45:19,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:45:19,849 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:45:19,960 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 03:45:20,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 294 places, 312 transitions, 648 flow [2022-12-13 03:45:20,199 INFO L130 PetriNetUnfolder]: 28/309 cut-off events. [2022-12-13 03:45:20,199 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:45:20,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 309 events. 28/309 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 508 event pairs, 0 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-13 03:45:20,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 312 transitions, 648 flow [2022-12-13 03:45:20,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 299 transitions, 616 flow [2022-12-13 03:45:20,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:20,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 281 places, 299 transitions, 616 flow [2022-12-13 03:45:20,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 299 transitions, 616 flow [2022-12-13 03:45:20,316 INFO L130 PetriNetUnfolder]: 28/299 cut-off events. [2022-12-13 03:45:20,316 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:45:20,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 28/299 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 508 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-13 03:45:20,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 281 places, 299 transitions, 616 flow [2022-12-13 03:45:20,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 14784 [2022-12-13 03:45:29,310 INFO L241 LiptonReduction]: Total number of compositions: 263 [2022-12-13 03:45:29,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:45:29,329 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;@4104f144, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:45:29,330 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:45:29,337 INFO L130 PetriNetUnfolder]: 8/35 cut-off events. [2022-12-13 03:45:29,338 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 03:45:29,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:29,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:29,339 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-13 03:45:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1970597914, now seen corresponding path program 1 times [2022-12-13 03:45:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:29,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320320376] [2022-12-13 03:45:29,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:29,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:30,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320320376] [2022-12-13 03:45:30,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320320376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:30,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:30,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:45:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849132044] [2022-12-13 03:45:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:30,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:45:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:45:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:45:30,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-13 03:45:30,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:30,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:30,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-13 03:45:30,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:30,619 INFO L130 PetriNetUnfolder]: 2074/3048 cut-off events. [2022-12-13 03:45:30,619 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-12-13 03:45:30,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 3048 events. 2074/3048 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13569 event pairs, 854 based on Foata normal form. 2/2258 useless extension candidates. Maximal degree in co-relation 1863. Up to 844 conditions per place. [2022-12-13 03:45:30,639 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 126 selfloop transitions, 8 changer transitions 8/144 dead transitions. [2022-12-13 03:45:30,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 144 transitions, 656 flow [2022-12-13 03:45:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:45:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:45:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-12-13 03:45:30,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 03:45:30,656 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-13 03:45:30,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 144 transitions, 656 flow [2022-12-13 03:45:30,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 136 transitions, 612 flow [2022-12-13 03:45:30,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:30,683 INFO L89 Accepts]: Start accepts. Operand has 45 places, 136 transitions, 612 flow [2022-12-13 03:45:30,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:30,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:30,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 136 transitions, 612 flow [2022-12-13 03:45:30,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 136 transitions, 612 flow [2022-12-13 03:45:30,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 03:45:31,760 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:45:31,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1080 [2022-12-13 03:45:31,762 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 135 transitions, 608 flow [2022-12-13 03:45:31,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:31,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:31,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:31,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:45:31,763 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-13 03:45:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1455515532, now seen corresponding path program 1 times [2022-12-13 03:45:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:31,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867154045] [2022-12-13 03:45:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:31,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:31,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867154045] [2022-12-13 03:45:31,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867154045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:31,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:31,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:45:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162973280] [2022-12-13 03:45:31,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:31,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:45:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:45:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:45:31,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-13 03:45:31,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 135 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:31,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:31,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-13 03:45:31,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:32,656 INFO L130 PetriNetUnfolder]: 3204/4719 cut-off events. [2022-12-13 03:45:32,656 INFO L131 PetriNetUnfolder]: For 616/644 co-relation queries the response was YES. [2022-12-13 03:45:32,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14235 conditions, 4719 events. 3204/4719 cut-off events. For 616/644 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23409 event pairs, 598 based on Foata normal form. 1/3593 useless extension candidates. Maximal degree in co-relation 3294. Up to 2555 conditions per place. [2022-12-13 03:45:32,683 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 258 selfloop transitions, 23 changer transitions 9/292 dead transitions. [2022-12-13 03:45:32,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 292 transitions, 1915 flow [2022-12-13 03:45:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:45:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:45:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2022-12-13 03:45:32,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5304054054054054 [2022-12-13 03:45:32,685 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-13 03:45:32,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 292 transitions, 1915 flow [2022-12-13 03:45:32,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 283 transitions, 1849 flow [2022-12-13 03:45:32,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:32,735 INFO L89 Accepts]: Start accepts. Operand has 51 places, 283 transitions, 1849 flow [2022-12-13 03:45:32,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:32,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:32,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 283 transitions, 1849 flow [2022-12-13 03:45:32,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 283 transitions, 1849 flow [2022-12-13 03:45:32,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-13 03:45:32,772 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:32,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 03:45:32,773 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 283 transitions, 1849 flow [2022-12-13 03:45:32,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:32,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:32,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:32,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:45:32,774 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-13 03:45:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1763647409, now seen corresponding path program 1 times [2022-12-13 03:45:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:32,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994919770] [2022-12-13 03:45:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:32,941 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-13 03:45:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:32,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994919770] [2022-12-13 03:45:32,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994919770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:32,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426388538] [2022-12-13 03:45:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:32,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:32,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:32,947 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-13 03:45:33,024 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-13 03:45:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:33,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 03:45:33,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:33,227 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-13 03:45:33,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:45:33,326 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-13 03:45:33,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426388538] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:33,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 03:45:33,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2022-12-13 03:45:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453778525] [2022-12-13 03:45:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:33,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:45:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:45:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-13 03:45:33,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 03:45:33,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 283 transitions, 1849 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:33,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:33,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 03:45:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:34,374 INFO L130 PetriNetUnfolder]: 4943/7297 cut-off events. [2022-12-13 03:45:34,374 INFO L131 PetriNetUnfolder]: For 2336/2432 co-relation queries the response was YES. [2022-12-13 03:45:34,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28948 conditions, 7297 events. 4943/7297 cut-off events. For 2336/2432 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 39004 event pairs, 520 based on Foata normal form. 0/5733 useless extension candidates. Maximal degree in co-relation 5446. Up to 4752 conditions per place. [2022-12-13 03:45:34,463 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 472 selfloop transitions, 35 changer transitions 0/508 dead transitions. [2022-12-13 03:45:34,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 03:45:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 03:45:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2022-12-13 03:45:34,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5709459459459459 [2022-12-13 03:45:34,468 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-13 03:45:34,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:34,545 INFO L89 Accepts]: Start accepts. Operand has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:34,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:34,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,563 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 03:45:34,615 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:34,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 03:45:34,617 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 508 transitions, 4352 flow [2022-12-13 03:45:34,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:34,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:34,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:34,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 03:45:34,826 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-13 03:45:34,827 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-13 03:45:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -429436951, now seen corresponding path program 1 times [2022-12-13 03:45:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:34,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783067055] [2022-12-13 03:45:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:34,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783067055] [2022-12-13 03:45:34,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783067055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:34,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:34,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:45:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734784800] [2022-12-13 03:45:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:34,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:45:34,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:34,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:45:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:45:34,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-13 03:45:34,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 508 transitions, 4352 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 03:45:34,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:34,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-13 03:45:34,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:35,532 INFO L130 PetriNetUnfolder]: 3025/4473 cut-off events. [2022-12-13 03:45:35,532 INFO L131 PetriNetUnfolder]: For 2916/2916 co-relation queries the response was YES. [2022-12-13 03:45:35,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22005 conditions, 4473 events. 3025/4473 cut-off events. For 2916/2916 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22096 event pairs, 198 based on Foata normal form. 272/3825 useless extension candidates. Maximal degree in co-relation 7684. Up to 2736 conditions per place. [2022-12-13 03:45:35,552 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 195 selfloop transitions, 0 changer transitions 247/444 dead transitions. [2022-12-13 03:45:35,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 444 transitions, 4674 flow [2022-12-13 03:45:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:45:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:45:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-13 03:45:35,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2022-12-13 03:45:35,557 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-13 03:45:35,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 444 transitions, 4674 flow [2022-12-13 03:45:35,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 197 transitions, 2054 flow [2022-12-13 03:45:35,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:35,591 INFO L89 Accepts]: Start accepts. Operand has 53 places, 197 transitions, 2054 flow [2022-12-13 03:45:35,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:35,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:35,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 197 transitions, 2054 flow [2022-12-13 03:45:35,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 197 transitions, 2054 flow [2022-12-13 03:45:35,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 03:45:39,084 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:45:39,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3495 [2022-12-13 03:45:39,085 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 196 transitions, 2044 flow [2022-12-13 03:45:39,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 03:45:39,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:39,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:39,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:45:39,086 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-13 03:45:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1721555866, now seen corresponding path program 1 times [2022-12-13 03:45:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:39,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147540655] [2022-12-13 03:45:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:39,411 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-13 03:45:39,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:39,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147540655] [2022-12-13 03:45:39,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147540655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:39,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095749771] [2022-12-13 03:45:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:39,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:39,414 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-13 03:45:39,445 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-13 03:45:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:39,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 03:45:39,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:45:39,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 03:45:39,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095749771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:39,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 03:45:39,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2022-12-13 03:45:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197120940] [2022-12-13 03:45:39,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:39,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:45:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:39,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:45:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:45:39,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 03:45:39,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 196 transitions, 2044 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:39,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:39,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 03:45:39,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:40,210 INFO L130 PetriNetUnfolder]: 3136/4468 cut-off events. [2022-12-13 03:45:40,210 INFO L131 PetriNetUnfolder]: For 5234/5234 co-relation queries the response was YES. [2022-12-13 03:45:40,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25913 conditions, 4468 events. 3136/4468 cut-off events. For 5234/5234 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20390 event pairs, 200 based on Foata normal form. 1/3462 useless extension candidates. Maximal degree in co-relation 9148. Up to 4343 conditions per place. [2022-12-13 03:45:40,233 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 292 selfloop transitions, 15 changer transitions 9/319 dead transitions. [2022-12-13 03:45:40,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 319 transitions, 3969 flow [2022-12-13 03:45:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:45:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:45:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-13 03:45:40,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2022-12-13 03:45:40,239 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-13 03:45:40,239 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 319 transitions, 3969 flow [2022-12-13 03:45:40,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 310 transitions, 3849 flow [2022-12-13 03:45:40,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:40,278 INFO L89 Accepts]: Start accepts. Operand has 58 places, 310 transitions, 3849 flow [2022-12-13 03:45:40,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:40,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:40,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 310 transitions, 3849 flow [2022-12-13 03:45:40,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 310 transitions, 3849 flow [2022-12-13 03:45:40,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-13 03:45:44,086 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:45:44,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3809 [2022-12-13 03:45:44,087 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 309 transitions, 3837 flow [2022-12-13 03:45:44,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:44,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:44,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:44,098 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-13 03:45:44,292 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-13 03:45:44,293 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-13 03:45:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash 816592441, now seen corresponding path program 1 times [2022-12-13 03:45:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:44,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838477702] [2022-12-13 03:45:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:44,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:44,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838477702] [2022-12-13 03:45:44,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838477702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:44,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:44,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:45:44,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706546730] [2022-12-13 03:45:44,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:44,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:45:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:45:44,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:45:44,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 03:45:44,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 309 transitions, 3837 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 03:45:44,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:44,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 03:45:44,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:44,887 INFO L130 PetriNetUnfolder]: 2306/3300 cut-off events. [2022-12-13 03:45:44,887 INFO L131 PetriNetUnfolder]: For 5730/5730 co-relation queries the response was YES. [2022-12-13 03:45:44,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22314 conditions, 3300 events. 2306/3300 cut-off events. For 5730/5730 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14329 event pairs, 150 based on Foata normal form. 50/2635 useless extension candidates. Maximal degree in co-relation 10652. Up to 3217 conditions per place. [2022-12-13 03:45:44,906 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 198 selfloop transitions, 0 changer transitions 53/252 dead transitions. [2022-12-13 03:45:44,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 252 transitions, 3633 flow [2022-12-13 03:45:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:45:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:45:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 03:45:44,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48125 [2022-12-13 03:45:44,911 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-13 03:45:44,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 252 transitions, 3633 flow [2022-12-13 03:45:44,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 199 transitions, 2870 flow [2022-12-13 03:45:44,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:44,940 INFO L89 Accepts]: Start accepts. Operand has 53 places, 199 transitions, 2870 flow [2022-12-13 03:45:44,944 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:44,944 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:44,944 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 199 transitions, 2870 flow [2022-12-13 03:45:44,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 199 transitions, 2870 flow [2022-12-13 03:45:44,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 03:45:50,365 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:45:50,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5426 [2022-12-13 03:45:50,366 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 198 transitions, 2856 flow [2022-12-13 03:45:50,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-13 03:45:50,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:50,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:50,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:45:50,367 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-13 03:45:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -165931981, now seen corresponding path program 1 times [2022-12-13 03:45:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:50,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125703994] [2022-12-13 03:45:50,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:50,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:50,859 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-13 03:45:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:50,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125703994] [2022-12-13 03:45:50,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125703994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 03:45:50,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203974457] [2022-12-13 03:45:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:45:50,864 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-13 03:45:50,889 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-13 03:45:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:50,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 03:45:50,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 03:45:51,104 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-13 03:45:51,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 03:45:51,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:45:51,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 164 [2022-12-13 03:45:51,400 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-13 03:45:51,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203974457] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 03:45:51,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 03:45:51,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-13 03:45:51,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805315315] [2022-12-13 03:45:51,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 03:45:51,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 03:45:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:51,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 03:45:51,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-12-13 03:45:51,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-13 03:45:51,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 198 transitions, 2856 flow. Second operand has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:51,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:51,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-13 03:45:51,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:52,637 INFO L130 PetriNetUnfolder]: 3988/5760 cut-off events. [2022-12-13 03:45:52,637 INFO L131 PetriNetUnfolder]: For 10524/10524 co-relation queries the response was YES. [2022-12-13 03:45:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44115 conditions, 5760 events. 3988/5760 cut-off events. For 10524/10524 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 28168 event pairs, 320 based on Foata normal form. 3/4680 useless extension candidates. Maximal degree in co-relation 12116. Up to 5585 conditions per place. [2022-12-13 03:45:52,664 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 185 selfloop transitions, 13 changer transitions 258/458 dead transitions. [2022-12-13 03:45:52,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 458 transitions, 7537 flow [2022-12-13 03:45:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:45:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:45:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2022-12-13 03:45:52,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39198606271777003 [2022-12-13 03:45:52,667 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2022-12-13 03:45:52,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 458 transitions, 7537 flow [2022-12-13 03:45:52,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 200 transitions, 3280 flow [2022-12-13 03:45:52,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:52,739 INFO L89 Accepts]: Start accepts. Operand has 59 places, 200 transitions, 3280 flow [2022-12-13 03:45:52,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:52,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:52,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 200 transitions, 3280 flow [2022-12-13 03:45:52,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 200 transitions, 3280 flow [2022-12-13 03:45:52,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-13 03:45:56,365 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:45:56,366 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3627 [2022-12-13 03:45:56,366 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 198 transitions, 3248 flow [2022-12-13 03:45:56,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:56,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:56,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:56,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 03:45:56,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 03:45:56,576 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-13 03:45:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1080150748, now seen corresponding path program 1 times [2022-12-13 03:45:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:56,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835837221] [2022-12-13 03:45:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:56,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835837221] [2022-12-13 03:45:56,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835837221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:56,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:56,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:45:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478400553] [2022-12-13 03:45:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:56,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:45:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:45:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:45:56,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:45:56,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 198 transitions, 3248 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:56,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:56,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:45:56,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:57,382 INFO L130 PetriNetUnfolder]: 3772/5375 cut-off events. [2022-12-13 03:45:57,383 INFO L131 PetriNetUnfolder]: For 12504/12504 co-relation queries the response was YES. [2022-12-13 03:45:57,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46358 conditions, 5375 events. 3772/5375 cut-off events. For 12504/12504 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25392 event pairs, 268 based on Foata normal form. 0/4263 useless extension candidates. Maximal degree in co-relation 19918. Up to 5218 conditions per place. [2022-12-13 03:45:57,413 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 324 selfloop transitions, 8 changer transitions 0/333 dead transitions. [2022-12-13 03:45:57,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:45:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:45:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-13 03:45:57,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-13 03:45:57,415 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 03:45:57,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:57,457 INFO L89 Accepts]: Start accepts. Operand has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:57,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:57,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 03:45:57,469 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:57,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:45:57,471 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 333 transitions, 6114 flow [2022-12-13 03:45:57,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:57,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:57,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:57,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:45:57,471 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-13 03:45:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash -11911830, now seen corresponding path program 1 times [2022-12-13 03:45:57,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:57,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700604615] [2022-12-13 03:45:57,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:45:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700604615] [2022-12-13 03:45:57,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700604615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:57,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:57,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:45:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067207325] [2022-12-13 03:45:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:57,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:45:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:45:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:45:57,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:45:57,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 333 transitions, 6114 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-13 03:45:57,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:57,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:45:57,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:58,370 INFO L130 PetriNetUnfolder]: 4495/6416 cut-off events. [2022-12-13 03:45:58,370 INFO L131 PetriNetUnfolder]: For 15780/15780 co-relation queries the response was YES. [2022-12-13 03:45:58,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61479 conditions, 6416 events. 4495/6416 cut-off events. For 15780/15780 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 31013 event pairs, 280 based on Foata normal form. 0/5120 useless extension candidates. Maximal degree in co-relation 22169. Up to 6227 conditions per place. [2022-12-13 03:45:58,415 INFO L137 encePairwiseOnDemand]: 37/42 looper letters, 367 selfloop transitions, 9 changer transitions 0/377 dead transitions. [2022-12-13 03:45:58,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:45:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:45:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 03:45:58,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-13 03:45:58,490 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2022-12-13 03:45:58,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:58,540 INFO L89 Accepts]: Start accepts. Operand has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:58,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:58,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-13 03:45:58,551 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:58,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 03:45:58,552 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 377 transitions, 7652 flow [2022-12-13 03:45:58,552 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-13 03:45:58,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:58,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:58,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:45:58,553 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-13 03:45:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1366051045, now seen corresponding path program 1 times [2022-12-13 03:45:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692568373] [2022-12-13 03:45:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:58,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:45:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:58,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692568373] [2022-12-13 03:45:58,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692568373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:58,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:58,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:45:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155180546] [2022-12-13 03:45:58,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:58,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:45:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:58,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:45:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:45:58,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 03:45:58,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 377 transitions, 7652 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:58,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:58,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 03:45:58,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:45:59,622 INFO L130 PetriNetUnfolder]: 5379/7696 cut-off events. [2022-12-13 03:45:59,622 INFO L131 PetriNetUnfolder]: For 20352/20352 co-relation queries the response was YES. [2022-12-13 03:45:59,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81192 conditions, 7696 events. 5379/7696 cut-off events. For 20352/20352 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38159 event pairs, 280 based on Foata normal form. 0/6140 useless extension candidates. Maximal degree in co-relation 29906. Up to 7475 conditions per place. [2022-12-13 03:45:59,666 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 400 selfloop transitions, 26 changer transitions 0/427 dead transitions. [2022-12-13 03:45:59,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:45:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:45:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 03:45:59,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-13 03:45:59,668 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-13 03:45:59,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:45:59,738 INFO L89 Accepts]: Start accepts. Operand has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:45:59,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:45:59,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 03:45:59,751 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:45:59,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:45:59,752 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 427 transitions, 9519 flow [2022-12-13 03:45:59,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:59,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:45:59,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:45:59,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:45:59,752 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-13 03:45:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:45:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1147230935, now seen corresponding path program 1 times [2022-12-13 03:45:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:45:59,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528661] [2022-12-13 03:45:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:45:59,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:45:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:45:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 03:45:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:45:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528661] [2022-12-13 03:45:59,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:45:59,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:45:59,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:45:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435051632] [2022-12-13 03:45:59,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:45:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:45:59,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:45:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:45:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:45:59,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 42 [2022-12-13 03:45:59,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 427 transitions, 9519 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:45:59,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:45:59,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 42 [2022-12-13 03:45:59,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:01,099 INFO L130 PetriNetUnfolder]: 5468/7854 cut-off events. [2022-12-13 03:46:01,099 INFO L131 PetriNetUnfolder]: For 27104/27104 co-relation queries the response was YES. [2022-12-13 03:46:01,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90112 conditions, 7854 events. 5468/7854 cut-off events. For 27104/27104 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 39453 event pairs, 262 based on Foata normal form. 1/6273 useless extension candidates. Maximal degree in co-relation 32514. Up to 7625 conditions per place. [2022-12-13 03:46:01,142 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 452 selfloop transitions, 17 changer transitions 6/482 dead transitions. [2022-12-13 03:46:01,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 482 transitions, 11709 flow [2022-12-13 03:46:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:46:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:46:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-13 03:46:01,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-13 03:46:01,144 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2022-12-13 03:46:01,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 482 transitions, 11709 flow [2022-12-13 03:46:01,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 476 transitions, 11559 flow [2022-12-13 03:46:01,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:01,224 INFO L89 Accepts]: Start accepts. Operand has 72 places, 476 transitions, 11559 flow [2022-12-13 03:46:01,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:01,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:01,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 476 transitions, 11559 flow [2022-12-13 03:46:01,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 476 transitions, 11559 flow [2022-12-13 03:46:01,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-13 03:46:01,237 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:01,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 03:46:01,238 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 476 transitions, 11559 flow [2022-12-13 03:46:01,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:46:01,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:01,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:01,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:46:01,239 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-13 03:46:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash -369199897, now seen corresponding path program 1 times [2022-12-13 03:46:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944490060] [2022-12-13 03:46:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:01,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944490060] [2022-12-13 03:46:02,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944490060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:02,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:02,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:46:02,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316087702] [2022-12-13 03:46:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:02,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:46:02,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:46:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:46:02,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:46:02,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 476 transitions, 11559 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:02,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:02,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:46:02,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:04,516 INFO L130 PetriNetUnfolder]: 7116/10260 cut-off events. [2022-12-13 03:46:04,516 INFO L131 PetriNetUnfolder]: For 30110/30110 co-relation queries the response was YES. [2022-12-13 03:46:04,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126757 conditions, 10260 events. 7116/10260 cut-off events. For 30110/30110 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 54181 event pairs, 306 based on Foata normal form. 1/8231 useless extension candidates. Maximal degree in co-relation 58550. Up to 9847 conditions per place. [2022-12-13 03:46:04,590 INFO L137 encePairwiseOnDemand]: 25/42 looper letters, 726 selfloop transitions, 75 changer transitions 12/813 dead transitions. [2022-12-13 03:46:04,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 813 transitions, 21204 flow [2022-12-13 03:46:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:46:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:46:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2022-12-13 03:46:04,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37362637362637363 [2022-12-13 03:46:04,592 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2022-12-13 03:46:04,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 813 transitions, 21204 flow [2022-12-13 03:46:04,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 801 transitions, 20894 flow [2022-12-13 03:46:04,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:04,735 INFO L89 Accepts]: Start accepts. Operand has 82 places, 801 transitions, 20894 flow [2022-12-13 03:46:04,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:04,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:04,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 801 transitions, 20894 flow [2022-12-13 03:46:04,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 801 transitions, 20894 flow [2022-12-13 03:46:04,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:04,756 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:04,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 03:46:04,757 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 801 transitions, 20894 flow [2022-12-13 03:46:04,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:04,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:04,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:04,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:46:04,757 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-13 03:46:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash 682025293, now seen corresponding path program 2 times [2022-12-13 03:46:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:04,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509624460] [2022-12-13 03:46:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:06,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:06,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509624460] [2022-12-13 03:46:06,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509624460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:06,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:06,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:46:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175903215] [2022-12-13 03:46:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:06,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:46:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:06,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:46:06,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:46:06,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:46:06,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 801 transitions, 20894 flow. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 03:46:06,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:06,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:46:06,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:09,879 INFO L130 PetriNetUnfolder]: 8208/11876 cut-off events. [2022-12-13 03:46:09,880 INFO L131 PetriNetUnfolder]: For 30588/30588 co-relation queries the response was YES. [2022-12-13 03:46:09,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159161 conditions, 11876 events. 8208/11876 cut-off events. For 30588/30588 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 64910 event pairs, 290 based on Foata normal form. 1/9509 useless extension candidates. Maximal degree in co-relation 84702. Up to 11463 conditions per place. [2022-12-13 03:46:09,956 INFO L137 encePairwiseOnDemand]: 25/42 looper letters, 955 selfloop transitions, 97 changer transitions 11/1063 dead transitions. [2022-12-13 03:46:09,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1063 transitions, 29778 flow [2022-12-13 03:46:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:46:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:46:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 202 transitions. [2022-12-13 03:46:09,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3435374149659864 [2022-12-13 03:46:09,961 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2022-12-13 03:46:09,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 1063 transitions, 29778 flow [2022-12-13 03:46:10,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 1052 transitions, 29458 flow [2022-12-13 03:46:10,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:10,109 INFO L89 Accepts]: Start accepts. Operand has 94 places, 1052 transitions, 29458 flow [2022-12-13 03:46:10,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:10,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:10,120 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 1052 transitions, 29458 flow [2022-12-13 03:46:10,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 1052 transitions, 29458 flow [2022-12-13 03:46:10,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:10,150 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:10,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 03:46:10,151 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 1052 transitions, 29458 flow [2022-12-13 03:46:10,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 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-13 03:46:10,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:10,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:10,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 03:46:10,151 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-13 03:46:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1100998811, now seen corresponding path program 3 times [2022-12-13 03:46:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:10,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357350506] [2022-12-13 03:46:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:10,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:10,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:10,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357350506] [2022-12-13 03:46:10,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357350506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:10,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:10,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:46:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680644216] [2022-12-13 03:46:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:10,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:46:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:10,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:46:10,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:46:10,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:46:10,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1052 transitions, 29458 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:10,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:10,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:46:10,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:14,716 INFO L130 PetriNetUnfolder]: 8627/12542 cut-off events. [2022-12-13 03:46:14,716 INFO L131 PetriNetUnfolder]: For 30712/30712 co-relation queries the response was YES. [2022-12-13 03:46:14,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180882 conditions, 12542 events. 8627/12542 cut-off events. For 30712/30712 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 69846 event pairs, 322 based on Foata normal form. 1/10047 useless extension candidates. Maximal degree in co-relation 99972. Up to 12129 conditions per place. [2022-12-13 03:46:14,809 INFO L137 encePairwiseOnDemand]: 24/42 looper letters, 1107 selfloop transitions, 107 changer transitions 7/1221 dead transitions. [2022-12-13 03:46:14,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 1221 transitions, 36659 flow [2022-12-13 03:46:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:46:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:46:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 203 transitions. [2022-12-13 03:46:14,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2022-12-13 03:46:14,811 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 68 predicate places. [2022-12-13 03:46:14,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 1221 transitions, 36659 flow [2022-12-13 03:46:15,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 1214 transitions, 36440 flow [2022-12-13 03:46:15,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:15,132 INFO L89 Accepts]: Start accepts. Operand has 105 places, 1214 transitions, 36440 flow [2022-12-13 03:46:15,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:15,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:15,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 1214 transitions, 36440 flow [2022-12-13 03:46:15,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 1214 transitions, 36440 flow [2022-12-13 03:46:15,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:15,179 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:15,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 03:46:15,180 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 1214 transitions, 36440 flow [2022-12-13 03:46:15,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:15,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:15,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:15,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 03:46:15,181 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-13 03:46:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1099009013, now seen corresponding path program 4 times [2022-12-13 03:46:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:15,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634573263] [2022-12-13 03:46:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:15,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:15,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634573263] [2022-12-13 03:46:15,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634573263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:15,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:15,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:46:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345547593] [2022-12-13 03:46:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:15,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:46:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:15,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:46:15,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:46:15,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:46:15,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 1214 transitions, 36440 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:15,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:15,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:46:15,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:19,639 INFO L130 PetriNetUnfolder]: 8632/12553 cut-off events. [2022-12-13 03:46:19,639 INFO L131 PetriNetUnfolder]: For 30722/30722 co-relation queries the response was YES. [2022-12-13 03:46:19,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193603 conditions, 12553 events. 8632/12553 cut-off events. For 30722/30722 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 69941 event pairs, 322 based on Foata normal form. 1/10058 useless extension candidates. Maximal degree in co-relation 107033. Up to 12140 conditions per place. [2022-12-13 03:46:19,739 INFO L137 encePairwiseOnDemand]: 24/42 looper letters, 1112 selfloop transitions, 108 changer transitions 7/1227 dead transitions. [2022-12-13 03:46:19,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 1227 transitions, 39299 flow [2022-12-13 03:46:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:46:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:46:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2022-12-13 03:46:19,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2022-12-13 03:46:19,741 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2022-12-13 03:46:19,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 1227 transitions, 39299 flow [2022-12-13 03:46:19,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 1220 transitions, 39066 flow [2022-12-13 03:46:19,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:19,909 INFO L89 Accepts]: Start accepts. Operand has 116 places, 1220 transitions, 39066 flow [2022-12-13 03:46:19,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:19,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:19,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 1220 transitions, 39066 flow [2022-12-13 03:46:19,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 1220 transitions, 39066 flow [2022-12-13 03:46:19,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:19,959 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:19,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 03:46:19,960 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 1220 transitions, 39066 flow [2022-12-13 03:46:19,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:19,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:19,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:19,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 03:46:19,961 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-13 03:46:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -848676443, now seen corresponding path program 5 times [2022-12-13 03:46:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:19,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4341271] [2022-12-13 03:46:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:20,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:20,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4341271] [2022-12-13 03:46:20,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4341271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:20,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:20,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:46:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006890333] [2022-12-13 03:46:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:20,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:46:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:46:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:46:20,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 03:46:20,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 1220 transitions, 39066 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:20,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:20,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 03:46:20,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:26,504 INFO L130 PetriNetUnfolder]: 13611/19915 cut-off events. [2022-12-13 03:46:26,505 INFO L131 PetriNetUnfolder]: For 42408/42408 co-relation queries the response was YES. [2022-12-13 03:46:26,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327074 conditions, 19915 events. 13611/19915 cut-off events. For 42408/42408 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 120497 event pairs, 442 based on Foata normal form. 1/15995 useless extension candidates. Maximal degree in co-relation 116480. Up to 19268 conditions per place. [2022-12-13 03:46:26,670 INFO L137 encePairwiseOnDemand]: 22/42 looper letters, 2086 selfloop transitions, 116 changer transitions 12/2214 dead transitions. [2022-12-13 03:46:26,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 2214 transitions, 75281 flow [2022-12-13 03:46:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:46:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:46:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 203 transitions. [2022-12-13 03:46:26,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-13 03:46:26,672 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2022-12-13 03:46:26,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 2214 transitions, 75281 flow [2022-12-13 03:46:26,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 2202 transitions, 74875 flow [2022-12-13 03:46:26,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:26,955 INFO L89 Accepts]: Start accepts. Operand has 127 places, 2202 transitions, 74875 flow [2022-12-13 03:46:26,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:26,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:26,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 2202 transitions, 74875 flow [2022-12-13 03:46:27,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 2202 transitions, 74875 flow [2022-12-13 03:46:27,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:32,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:46:32,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5322 [2022-12-13 03:46:32,277 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 2201 transitions, 74841 flow [2022-12-13 03:46:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-13 03:46:32,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:32,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:32,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 03:46:32,278 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-13 03:46:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1268845893, now seen corresponding path program 1 times [2022-12-13 03:46:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:32,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162196908] [2022-12-13 03:46:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:33,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:33,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162196908] [2022-12-13 03:46:33,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162196908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:33,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:33,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:46:33,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197706155] [2022-12-13 03:46:33,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:33,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:46:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:46:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:46:33,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:46:33,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 2201 transitions, 74841 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:46:33,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:33,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:46:33,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:41,577 INFO L130 PetriNetUnfolder]: 13600/19899 cut-off events. [2022-12-13 03:46:41,578 INFO L131 PetriNetUnfolder]: For 45013/45013 co-relation queries the response was YES. [2022-12-13 03:46:41,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346729 conditions, 19899 events. 13600/19899 cut-off events. For 45013/45013 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 120547 event pairs, 428 based on Foata normal form. 1/15983 useless extension candidates. Maximal degree in co-relation 123341. Up to 19252 conditions per place. [2022-12-13 03:46:41,872 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 2084 selfloop transitions, 116 changer transitions 7/2207 dead transitions. [2022-12-13 03:46:41,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 2207 transitions, 79468 flow [2022-12-13 03:46:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:46:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:46:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-12-13 03:46:41,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3667262969588551 [2022-12-13 03:46:41,873 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 100 predicate places. [2022-12-13 03:46:41,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 2207 transitions, 79468 flow [2022-12-13 03:46:42,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 2200 transitions, 79207 flow [2022-12-13 03:46:42,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:42,149 INFO L89 Accepts]: Start accepts. Operand has 137 places, 2200 transitions, 79207 flow [2022-12-13 03:46:42,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:42,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:42,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 2200 transitions, 79207 flow [2022-12-13 03:46:42,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 2200 transitions, 79207 flow [2022-12-13 03:46:42,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:42,212 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:42,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 03:46:42,213 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 2200 transitions, 79207 flow [2022-12-13 03:46:42,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:46:42,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:42,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:42,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 03:46:42,213 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-13 03:46:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1793926683, now seen corresponding path program 2 times [2022-12-13 03:46:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:42,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478538804] [2022-12-13 03:46:42,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478538804] [2022-12-13 03:46:43,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478538804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:43,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:46:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268525639] [2022-12-13 03:46:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:43,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:46:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:43,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:46:43,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:46:43,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:46:43,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 2200 transitions, 79207 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:46:43,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:43,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:46:43,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:46:52,056 INFO L130 PetriNetUnfolder]: 13595/19886 cut-off events. [2022-12-13 03:46:52,056 INFO L131 PetriNetUnfolder]: For 45002/45002 co-relation queries the response was YES. [2022-12-13 03:46:52,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366379 conditions, 19886 events. 13595/19886 cut-off events. For 45002/45002 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 120509 event pairs, 404 based on Foata normal form. 1/15976 useless extension candidates. Maximal degree in co-relation 130296. Up to 19239 conditions per place. [2022-12-13 03:46:52,239 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 2073 selfloop transitions, 115 changer transitions 11/2199 dead transitions. [2022-12-13 03:46:52,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 2199 transitions, 83569 flow [2022-12-13 03:46:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:46:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:46:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2022-12-13 03:46:52,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35778175313059035 [2022-12-13 03:46:52,240 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2022-12-13 03:46:52,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 2199 transitions, 83569 flow [2022-12-13 03:46:52,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 2188 transitions, 83139 flow [2022-12-13 03:46:52,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:46:52,536 INFO L89 Accepts]: Start accepts. Operand has 147 places, 2188 transitions, 83139 flow [2022-12-13 03:46:52,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:46:52,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:46:52,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 2188 transitions, 83139 flow [2022-12-13 03:46:52,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 2188 transitions, 83139 flow [2022-12-13 03:46:52,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:46:52,628 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:46:52,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 03:46:52,629 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 2188 transitions, 83139 flow [2022-12-13 03:46:52,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:46:52,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:46:52,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:46:52,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 03:46:52,629 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-13 03:46:52,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:46:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1689280487, now seen corresponding path program 3 times [2022-12-13 03:46:52,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:46:52,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747194880] [2022-12-13 03:46:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:46:52,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:46:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:46:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:46:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:46:53,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747194880] [2022-12-13 03:46:53,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747194880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:46:53,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:46:53,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:46:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325713096] [2022-12-13 03:46:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:46:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:46:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:46:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:46:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:46:53,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:46:53,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 2188 transitions, 83139 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:46:53,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:46:53,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:46:53,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:02,485 INFO L130 PetriNetUnfolder]: 14129/20763 cut-off events. [2022-12-13 03:47:02,486 INFO L131 PetriNetUnfolder]: For 47776/47776 co-relation queries the response was YES. [2022-12-13 03:47:02,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403616 conditions, 20763 events. 14129/20763 cut-off events. For 47776/47776 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 127730 event pairs, 420 based on Foata normal form. 2/16650 useless extension candidates. Maximal degree in co-relation 144948. Up to 20116 conditions per place. [2022-12-13 03:47:02,666 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2242 selfloop transitions, 236 changer transitions 24/2502 dead transitions. [2022-12-13 03:47:02,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 2502 transitions, 100117 flow [2022-12-13 03:47:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 03:47:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 03:47:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 223 transitions. [2022-12-13 03:47:02,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3241279069767442 [2022-12-13 03:47:02,668 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 124 predicate places. [2022-12-13 03:47:02,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 2502 transitions, 100117 flow [2022-12-13 03:47:02,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 2478 transitions, 99161 flow [2022-12-13 03:47:02,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:47:02,984 INFO L89 Accepts]: Start accepts. Operand has 160 places, 2478 transitions, 99161 flow [2022-12-13 03:47:03,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:47:03,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:47:03,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 2478 transitions, 99161 flow [2022-12-13 03:47:03,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 2478 transitions, 99161 flow [2022-12-13 03:47:03,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:47:03,237 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:47:03,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-13 03:47:03,238 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 2478 transitions, 99161 flow [2022-12-13 03:47:03,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:47:03,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:47:03,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:47:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 03:47:03,238 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-13 03:47:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:47:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1374080079, now seen corresponding path program 4 times [2022-12-13 03:47:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:47:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691619249] [2022-12-13 03:47:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:47:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:47:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:47:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:47:04,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691619249] [2022-12-13 03:47:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691619249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:47:04,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:47:04,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:47:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928613956] [2022-12-13 03:47:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:47:04,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:47:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:47:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:47:04,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:47:04,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 2478 transitions, 99161 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:47:04,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:04,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:47:04,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:15,457 INFO L130 PetriNetUnfolder]: 14126/20772 cut-off events. [2022-12-13 03:47:15,457 INFO L131 PetriNetUnfolder]: For 45169/45169 co-relation queries the response was YES. [2022-12-13 03:47:15,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424600 conditions, 20772 events. 14126/20772 cut-off events. For 45169/45169 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 127924 event pairs, 380 based on Foata normal form. 2/16663 useless extension candidates. Maximal degree in co-relation 152986. Up to 20125 conditions per place. [2022-12-13 03:47:15,666 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2354 selfloop transitions, 124 changer transitions 24/2502 dead transitions. [2022-12-13 03:47:15,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 2502 transitions, 105135 flow [2022-12-13 03:47:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:47:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:47:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2022-12-13 03:47:15,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3416815742397138 [2022-12-13 03:47:15,668 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 134 predicate places. [2022-12-13 03:47:15,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 2502 transitions, 105135 flow [2022-12-13 03:47:15,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 2478 transitions, 104131 flow [2022-12-13 03:47:16,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:47:16,262 INFO L89 Accepts]: Start accepts. Operand has 170 places, 2478 transitions, 104131 flow [2022-12-13 03:47:16,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:47:16,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:47:16,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 2478 transitions, 104131 flow [2022-12-13 03:47:16,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 2478 transitions, 104131 flow [2022-12-13 03:47:16,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:47:16,334 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:47:16,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 03:47:16,335 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 2478 transitions, 104131 flow [2022-12-13 03:47:16,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:47:16,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:47:16,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:47:16,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 03:47:16,335 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-13 03:47:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:47:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 886748457, now seen corresponding path program 5 times [2022-12-13 03:47:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:47:16,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414007705] [2022-12-13 03:47:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:47:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:47:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:47:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:47:17,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414007705] [2022-12-13 03:47:17,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414007705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:47:17,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:47:17,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:47:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519352281] [2022-12-13 03:47:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:47:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:47:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:47:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:47:17,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:47:17,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 2478 transitions, 104131 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:47:17,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:17,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:47:17,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:28,180 INFO L130 PetriNetUnfolder]: 14195/20891 cut-off events. [2022-12-13 03:47:28,180 INFO L131 PetriNetUnfolder]: For 45195/45195 co-relation queries the response was YES. [2022-12-13 03:47:28,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448005 conditions, 20891 events. 14195/20891 cut-off events. For 45195/45195 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 129021 event pairs, 380 based on Foata normal form. 2/16756 useless extension candidates. Maximal degree in co-relation 162888. Up to 20244 conditions per place. [2022-12-13 03:47:28,368 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2376 selfloop transitions, 138 changer transitions 22/2536 dead transitions. [2022-12-13 03:47:28,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 2536 transitions, 111659 flow [2022-12-13 03:47:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:47:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:47:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2022-12-13 03:47:28,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3434704830053667 [2022-12-13 03:47:28,370 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 144 predicate places. [2022-12-13 03:47:28,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 2536 transitions, 111659 flow [2022-12-13 03:47:28,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 2514 transitions, 110667 flow [2022-12-13 03:47:28,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:47:28,826 INFO L89 Accepts]: Start accepts. Operand has 180 places, 2514 transitions, 110667 flow [2022-12-13 03:47:28,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:47:28,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:47:28,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 2514 transitions, 110667 flow [2022-12-13 03:47:28,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 2514 transitions, 110667 flow [2022-12-13 03:47:28,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:47:28,899 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:47:28,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 03:47:28,900 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 2514 transitions, 110667 flow [2022-12-13 03:47:28,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:47:28,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:47:28,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:47:28,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 03:47:28,901 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-13 03:47:28,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:47:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash 361667667, now seen corresponding path program 6 times [2022-12-13 03:47:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:47:28,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216777346] [2022-12-13 03:47:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:47:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:47:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:47:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:47:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216777346] [2022-12-13 03:47:30,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216777346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:47:30,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:47:30,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:47:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334686655] [2022-12-13 03:47:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:47:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:47:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:47:30,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:47:30,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:47:30,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 2514 transitions, 110667 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:47:30,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:30,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:47:30,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:40,779 INFO L130 PetriNetUnfolder]: 14183/20856 cut-off events. [2022-12-13 03:47:40,779 INFO L131 PetriNetUnfolder]: For 42569/42569 co-relation queries the response was YES. [2022-12-13 03:47:40,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468084 conditions, 20856 events. 14183/20856 cut-off events. For 42569/42569 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 128485 event pairs, 418 based on Foata normal form. 1/16728 useless extension candidates. Maximal degree in co-relation 169842. Up to 20209 conditions per place. [2022-12-13 03:47:40,992 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 2385 selfloop transitions, 121 changer transitions 7/2513 dead transitions. [2022-12-13 03:47:40,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 2513 transitions, 115649 flow [2022-12-13 03:47:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:47:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:47:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2022-12-13 03:47:40,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3470483005366726 [2022-12-13 03:47:40,994 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 154 predicate places. [2022-12-13 03:47:40,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 2513 transitions, 115649 flow [2022-12-13 03:47:41,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 2506 transitions, 115318 flow [2022-12-13 03:47:41,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:47:41,581 INFO L89 Accepts]: Start accepts. Operand has 191 places, 2506 transitions, 115318 flow [2022-12-13 03:47:41,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:47:41,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:47:41,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 2506 transitions, 115318 flow [2022-12-13 03:47:41,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 2506 transitions, 115318 flow [2022-12-13 03:47:41,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:47:41,659 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:47:41,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 03:47:41,659 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 2506 transitions, 115318 flow [2022-12-13 03:47:41,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:47:41,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:47:41,660 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:47:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 03:47:41,660 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-13 03:47:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:47:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1964796085, now seen corresponding path program 7 times [2022-12-13 03:47:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:47:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583872155] [2022-12-13 03:47:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:47:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:47:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:47:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:47:42,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583872155] [2022-12-13 03:47:42,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583872155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:47:42,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:47:42,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:47:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896900756] [2022-12-13 03:47:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:47:42,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:47:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:47:42,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:47:42,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:47:42,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 2506 transitions, 115318 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:47:42,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:42,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:47:42,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:47:53,904 INFO L130 PetriNetUnfolder]: 15093/22164 cut-off events. [2022-12-13 03:47:53,904 INFO L131 PetriNetUnfolder]: For 43396/43396 co-relation queries the response was YES. [2022-12-13 03:47:53,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519666 conditions, 22164 events. 15093/22164 cut-off events. For 43396/43396 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 137600 event pairs, 416 based on Foata normal form. 1/17696 useless extension candidates. Maximal degree in co-relation 206637. Up to 21487 conditions per place. [2022-12-13 03:47:54,140 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2598 selfloop transitions, 222 changer transitions 12/2832 dead transitions. [2022-12-13 03:47:54,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 2832 transitions, 135858 flow [2022-12-13 03:47:54,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 03:47:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 03:47:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 258 transitions. [2022-12-13 03:47:54,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 03:47:54,142 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 170 predicate places. [2022-12-13 03:47:54,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 2832 transitions, 135858 flow [2022-12-13 03:47:54,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 2820 transitions, 135284 flow [2022-12-13 03:47:54,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:47:54,547 INFO L89 Accepts]: Start accepts. Operand has 206 places, 2820 transitions, 135284 flow [2022-12-13 03:47:54,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:47:54,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:47:54,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 2820 transitions, 135284 flow [2022-12-13 03:47:54,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 2820 transitions, 135284 flow [2022-12-13 03:47:54,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:47:54,651 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:47:54,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-13 03:47:54,652 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 2820 transitions, 135284 flow [2022-12-13 03:47:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:47:54,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:47:54,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:47:54,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 03:47:54,652 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-13 03:47:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:47:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash 495932005, now seen corresponding path program 8 times [2022-12-13 03:47:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:47:54,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456198144] [2022-12-13 03:47:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:47:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:47:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:47:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:47:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:47:55,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456198144] [2022-12-13 03:47:55,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456198144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:47:55,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:47:55,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:47:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434627249] [2022-12-13 03:47:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:47:55,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:47:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:47:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:47:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:47:55,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:47:55,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 2820 transitions, 135284 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:47:55,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:47:55,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:47:55,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:48:08,303 INFO L130 PetriNetUnfolder]: 15102/22209 cut-off events. [2022-12-13 03:48:08,303 INFO L131 PetriNetUnfolder]: For 48603/48603 co-relation queries the response was YES. [2022-12-13 03:48:08,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542967 conditions, 22209 events. 15102/22209 cut-off events. For 48603/48603 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 138318 event pairs, 388 based on Foata normal form. 1/17741 useless extension candidates. Maximal degree in co-relation 216389. Up to 21532 conditions per place. [2022-12-13 03:48:08,576 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 2673 selfloop transitions, 171 changer transitions 12/2856 dead transitions. [2022-12-13 03:48:08,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 2856 transitions, 142746 flow [2022-12-13 03:48:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:48:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:48:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2022-12-13 03:48:08,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36493738819320215 [2022-12-13 03:48:08,578 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 180 predicate places. [2022-12-13 03:48:08,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 2856 transitions, 142746 flow [2022-12-13 03:48:08,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 2844 transitions, 142148 flow [2022-12-13 03:48:09,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:09,164 INFO L89 Accepts]: Start accepts. Operand has 216 places, 2844 transitions, 142148 flow [2022-12-13 03:48:09,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:09,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:09,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 2844 transitions, 142148 flow [2022-12-13 03:48:09,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 2844 transitions, 142148 flow [2022-12-13 03:48:09,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:09,268 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:48:09,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 03:48:09,268 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 2844 transitions, 142148 flow [2022-12-13 03:48:09,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:48:09,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:09,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:09,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 03:48:09,269 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-13 03:48:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash 811132413, now seen corresponding path program 9 times [2022-12-13 03:48:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:09,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520006145] [2022-12-13 03:48:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:10,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520006145] [2022-12-13 03:48:10,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520006145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:48:10,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:48:10,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:48:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619865052] [2022-12-13 03:48:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:48:10,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:48:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:48:10,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:48:10,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:48:10,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:48:10,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 2844 transitions, 142148 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:48:10,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:48:10,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:48:10,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:48:23,914 INFO L130 PetriNetUnfolder]: 15092/22187 cut-off events. [2022-12-13 03:48:23,914 INFO L131 PetriNetUnfolder]: For 46001/46001 co-relation queries the response was YES. [2022-12-13 03:48:23,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564629 conditions, 22187 events. 15092/22187 cut-off events. For 46001/46001 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 138092 event pairs, 408 based on Foata normal form. 1/17723 useless extension candidates. Maximal degree in co-relation 224804. Up to 21510 conditions per place. [2022-12-13 03:48:24,140 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2661 selfloop transitions, 170 changer transitions 12/2843 dead transitions. [2022-12-13 03:48:24,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 2843 transitions, 147784 flow [2022-12-13 03:48:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:48:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:48:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2022-12-13 03:48:24,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3559928443649374 [2022-12-13 03:48:24,141 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 190 predicate places. [2022-12-13 03:48:24,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 2843 transitions, 147784 flow [2022-12-13 03:48:24,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 2831 transitions, 147162 flow [2022-12-13 03:48:24,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:24,692 INFO L89 Accepts]: Start accepts. Operand has 226 places, 2831 transitions, 147162 flow [2022-12-13 03:48:24,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:24,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:24,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 2831 transitions, 147162 flow [2022-12-13 03:48:24,803 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 2831 transitions, 147162 flow [2022-12-13 03:48:24,803 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:24,811 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:48:24,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 03:48:24,812 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 2831 transitions, 147162 flow [2022-12-13 03:48:24,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:48:24,812 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:24,812 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:24,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 03:48:24,813 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-13 03:48:24,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1748087137, now seen corresponding path program 10 times [2022-12-13 03:48:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:24,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462014293] [2022-12-13 03:48:24,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:25,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462014293] [2022-12-13 03:48:25,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462014293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:48:25,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:48:25,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:48:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155177457] [2022-12-13 03:48:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:48:25,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:48:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:48:25,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:48:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:48:25,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:48:25,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 2831 transitions, 147162 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:48:25,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:48:25,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:48:25,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:48:38,934 INFO L130 PetriNetUnfolder]: 15081/22172 cut-off events. [2022-12-13 03:48:38,935 INFO L131 PetriNetUnfolder]: For 45994/45994 co-relation queries the response was YES. [2022-12-13 03:48:38,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586439 conditions, 22172 events. 15081/22172 cut-off events. For 45994/45994 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 138099 event pairs, 420 based on Foata normal form. 1/17712 useless extension candidates. Maximal degree in co-relation 233265. Up to 21495 conditions per place. [2022-12-13 03:48:39,177 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2658 selfloop transitions, 172 changer transitions 7/2837 dead transitions. [2022-12-13 03:48:39,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 2837 transitions, 153157 flow [2022-12-13 03:48:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:48:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:48:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-12-13 03:48:39,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3667262969588551 [2022-12-13 03:48:39,179 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 200 predicate places. [2022-12-13 03:48:39,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 2837 transitions, 153157 flow [2022-12-13 03:48:39,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 2830 transitions, 152770 flow [2022-12-13 03:48:39,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:39,704 INFO L89 Accepts]: Start accepts. Operand has 237 places, 2830 transitions, 152770 flow [2022-12-13 03:48:39,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:39,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:39,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 2830 transitions, 152770 flow [2022-12-13 03:48:39,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 237 places, 2830 transitions, 152770 flow [2022-12-13 03:48:39,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:39,808 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:48:39,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 03:48:39,809 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 2830 transitions, 152770 flow [2022-12-13 03:48:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:48:39,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:39,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 03:48:39,810 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-13 03:48:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1223006347, now seen corresponding path program 11 times [2022-12-13 03:48:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971054119] [2022-12-13 03:48:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:40,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971054119] [2022-12-13 03:48:40,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971054119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:48:40,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:48:40,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:48:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180037457] [2022-12-13 03:48:40,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:48:40,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:48:40,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:48:40,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:48:40,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:48:40,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:48:40,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 2830 transitions, 152770 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:48:40,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:48:40,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:48:40,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:48:54,318 INFO L130 PetriNetUnfolder]: 15076/22159 cut-off events. [2022-12-13 03:48:54,318 INFO L131 PetriNetUnfolder]: For 43391/43391 co-relation queries the response was YES. [2022-12-13 03:48:54,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608245 conditions, 22159 events. 15076/22159 cut-off events. For 43391/43391 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 137859 event pairs, 416 based on Foata normal form. 1/17705 useless extension candidates. Maximal degree in co-relation 241892. Up to 21482 conditions per place. [2022-12-13 03:48:54,697 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2647 selfloop transitions, 171 changer transitions 11/2829 dead transitions. [2022-12-13 03:48:54,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 2829 transitions, 158374 flow [2022-12-13 03:48:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:48:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:48:54,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2022-12-13 03:48:54,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35778175313059035 [2022-12-13 03:48:54,699 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 211 predicate places. [2022-12-13 03:48:54,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 2829 transitions, 158374 flow [2022-12-13 03:48:54,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 2818 transitions, 157746 flow [2022-12-13 03:48:55,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:48:55,130 INFO L89 Accepts]: Start accepts. Operand has 247 places, 2818 transitions, 157746 flow [2022-12-13 03:48:55,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:48:55,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:48:55,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 2818 transitions, 157746 flow [2022-12-13 03:48:55,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 2818 transitions, 157746 flow [2022-12-13 03:48:55,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:48:55,239 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:48:55,240 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-13 03:48:55,240 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 2818 transitions, 157746 flow [2022-12-13 03:48:55,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:48:55,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:48:55,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:48:55,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 03:48:55,241 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-13 03:48:55,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:48:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2038212943, now seen corresponding path program 12 times [2022-12-13 03:48:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:48:55,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749479669] [2022-12-13 03:48:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:48:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:48:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:48:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:48:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:48:56,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749479669] [2022-12-13 03:48:56,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749479669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:48:56,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:48:56,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:48:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239196535] [2022-12-13 03:48:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:48:56,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:48:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:48:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:48:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:48:56,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:48:56,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 2818 transitions, 157746 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:48:56,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:48:56,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:48:56,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:49:09,505 INFO L130 PetriNetUnfolder]: 15102/22219 cut-off events. [2022-12-13 03:49:09,505 INFO L131 PetriNetUnfolder]: For 46016/46016 co-relation queries the response was YES. [2022-12-13 03:49:09,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632110 conditions, 22219 events. 15102/22219 cut-off events. For 46016/46016 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 138494 event pairs, 420 based on Foata normal form. 1/17763 useless extension candidates. Maximal degree in co-relation 252296. Up to 21542 conditions per place. [2022-12-13 03:49:09,746 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2679 selfloop transitions, 161 changer transitions 12/2852 dead transitions. [2022-12-13 03:49:09,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 2852 transitions, 165350 flow [2022-12-13 03:49:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:49:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:49:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2022-12-13 03:49:09,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.370304114490161 [2022-12-13 03:49:09,748 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 221 predicate places. [2022-12-13 03:49:09,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 2852 transitions, 165350 flow [2022-12-13 03:49:10,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 2840 transitions, 164656 flow [2022-12-13 03:49:10,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:49:10,197 INFO L89 Accepts]: Start accepts. Operand has 257 places, 2840 transitions, 164656 flow [2022-12-13 03:49:10,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:49:10,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:49:10,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 257 places, 2840 transitions, 164656 flow [2022-12-13 03:49:10,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 257 places, 2840 transitions, 164656 flow [2022-12-13 03:49:10,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:49:10,309 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:49:10,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 03:49:10,309 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 2840 transitions, 164656 flow [2022-12-13 03:49:10,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:49:10,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:49:10,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:49:10,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 03:49:10,310 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-13 03:49:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:49:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash 422515147, now seen corresponding path program 13 times [2022-12-13 03:49:10,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:49:10,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098724133] [2022-12-13 03:49:10,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:49:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:49:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:49:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:49:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:49:11,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098724133] [2022-12-13 03:49:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098724133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:49:11,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:49:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:49:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224766881] [2022-12-13 03:49:11,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:49:11,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:49:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:49:11,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:49:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:49:11,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:49:11,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 2840 transitions, 164656 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:49:11,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:49:11,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:49:11,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:49:26,420 INFO L130 PetriNetUnfolder]: 15214/22409 cut-off events. [2022-12-13 03:49:26,421 INFO L131 PetriNetUnfolder]: For 46059/46059 co-relation queries the response was YES. [2022-12-13 03:49:26,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660025 conditions, 22409 events. 15214/22409 cut-off events. For 46059/46059 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 140126 event pairs, 384 based on Foata normal form. 1/17907 useless extension candidates. Maximal degree in co-relation 266077. Up to 21732 conditions per place. [2022-12-13 03:49:26,672 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 2717 selfloop transitions, 190 changer transitions 12/2919 dead transitions. [2022-12-13 03:49:26,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 2919 transitions, 175111 flow [2022-12-13 03:49:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:49:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:49:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 203 transitions. [2022-12-13 03:49:26,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3631484794275492 [2022-12-13 03:49:26,674 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 231 predicate places. [2022-12-13 03:49:26,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 2919 transitions, 175111 flow [2022-12-13 03:49:27,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 269 places, 2907 transitions, 174393 flow [2022-12-13 03:49:27,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:49:27,259 INFO L89 Accepts]: Start accepts. Operand has 269 places, 2907 transitions, 174393 flow [2022-12-13 03:49:27,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:49:27,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:49:27,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 269 places, 2907 transitions, 174393 flow [2022-12-13 03:49:27,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 269 places, 2907 transitions, 174393 flow [2022-12-13 03:49:27,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:49:27,370 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:49:27,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 03:49:27,370 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 2907 transitions, 174393 flow [2022-12-13 03:49:27,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:49:27,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:49:27,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:49:27,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 03:49:27,371 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-13 03:49:27,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:49:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1821503995, now seen corresponding path program 14 times [2022-12-13 03:49:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:49:27,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379739503] [2022-12-13 03:49:27,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:49:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:49:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:49:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:49:28,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:49:28,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379739503] [2022-12-13 03:49:28,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379739503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:49:28,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:49:28,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:49:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009202270] [2022-12-13 03:49:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:49:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:49:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:49:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:49:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:49:28,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:49:28,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 2907 transitions, 174393 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:49:28,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:49:28,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:49:28,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:49:42,599 INFO L130 PetriNetUnfolder]: 15203/22394 cut-off events. [2022-12-13 03:49:42,599 INFO L131 PetriNetUnfolder]: For 43460/43460 co-relation queries the response was YES. [2022-12-13 03:49:42,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681997 conditions, 22394 events. 15203/22394 cut-off events. For 43460/43460 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 140088 event pairs, 416 based on Foata normal form. 1/17896 useless extension candidates. Maximal degree in co-relation 274676. Up to 21717 conditions per place. [2022-12-13 03:49:42,856 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2735 selfloop transitions, 171 changer transitions 7/2913 dead transitions. [2022-12-13 03:49:42,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 2913 transitions, 180588 flow [2022-12-13 03:49:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:49:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:49:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2022-12-13 03:49:42,857 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36493738819320215 [2022-12-13 03:49:42,857 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 243 predicate places. [2022-12-13 03:49:42,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 2913 transitions, 180588 flow [2022-12-13 03:49:43,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 2906 transitions, 180145 flow [2022-12-13 03:49:43,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:49:43,425 INFO L89 Accepts]: Start accepts. Operand has 280 places, 2906 transitions, 180145 flow [2022-12-13 03:49:43,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:49:43,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:49:43,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 2906 transitions, 180145 flow [2022-12-13 03:49:43,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 2906 transitions, 180145 flow [2022-12-13 03:49:43,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:49:43,540 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:49:43,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 03:49:43,544 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 2906 transitions, 180145 flow [2022-12-13 03:49:43,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:49:43,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:49:43,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:49:43,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 03:49:43,545 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-13 03:49:43,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:49:43,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1296423205, now seen corresponding path program 15 times [2022-12-13 03:49:43,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:49:43,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903254366] [2022-12-13 03:49:43,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:49:43,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:49:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:49:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:49:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:49:44,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903254366] [2022-12-13 03:49:44,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903254366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:49:44,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:49:44,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:49:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254873130] [2022-12-13 03:49:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:49:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:49:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:49:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:49:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:49:44,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:49:44,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 2906 transitions, 180145 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:49:44,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:49:44,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:49:44,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:49:59,768 INFO L130 PetriNetUnfolder]: 15209/22398 cut-off events. [2022-12-13 03:49:59,768 INFO L131 PetriNetUnfolder]: For 46075/46075 co-relation queries the response was YES. [2022-12-13 03:49:59,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704519 conditions, 22398 events. 15209/22398 cut-off events. For 46075/46075 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 140102 event pairs, 402 based on Foata normal form. 1/17900 useless extension candidates. Maximal degree in co-relation 283826. Up to 21721 conditions per place. [2022-12-13 03:50:00,149 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2728 selfloop transitions, 173 changer transitions 11/2912 dead transitions. [2022-12-13 03:50:00,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 2912 transitions, 186347 flow [2022-12-13 03:50:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 03:50:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 03:50:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 212 transitions. [2022-12-13 03:50:00,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32868217054263565 [2022-12-13 03:50:00,151 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 256 predicate places. [2022-12-13 03:50:00,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 2912 transitions, 186347 flow [2022-12-13 03:50:00,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 2901 transitions, 185631 flow [2022-12-13 03:50:00,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:50:00,625 INFO L89 Accepts]: Start accepts. Operand has 292 places, 2901 transitions, 185631 flow [2022-12-13 03:50:00,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:00,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:00,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 2901 transitions, 185631 flow [2022-12-13 03:50:00,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 2901 transitions, 185631 flow [2022-12-13 03:50:00,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:00,840 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:50:00,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 03:50:00,841 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 2901 transitions, 185631 flow [2022-12-13 03:50:00,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:50:00,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:00,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:00,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 03:50:00,841 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-13 03:50:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 737715555, now seen corresponding path program 16 times [2022-12-13 03:50:00,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:00,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670965488] [2022-12-13 03:50:00,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:00,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:01,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:01,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670965488] [2022-12-13 03:50:01,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670965488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:50:01,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:50:01,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:50:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713693420] [2022-12-13 03:50:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:50:01,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:50:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:50:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:50:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:50:01,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:50:01,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 2901 transitions, 185631 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:50:01,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:50:01,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:50:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:50:16,854 INFO L130 PetriNetUnfolder]: 15203/22380 cut-off events. [2022-12-13 03:50:16,854 INFO L131 PetriNetUnfolder]: For 46049/46049 co-relation queries the response was YES. [2022-12-13 03:50:16,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726320 conditions, 22380 events. 15203/22380 cut-off events. For 46049/46049 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 139884 event pairs, 420 based on Foata normal form. 1/17886 useless extension candidates. Maximal degree in co-relation 292388. Up to 21703 conditions per place. [2022-12-13 03:50:17,120 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2722 selfloop transitions, 166 changer transitions 12/2900 dead transitions. [2022-12-13 03:50:17,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 2900 transitions, 191367 flow [2022-12-13 03:50:17,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:50:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:50:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2022-12-13 03:50:17,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3542039355992844 [2022-12-13 03:50:17,122 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 266 predicate places. [2022-12-13 03:50:17,122 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 2900 transitions, 191367 flow [2022-12-13 03:50:17,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 2888 transitions, 190577 flow [2022-12-13 03:50:17,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:50:17,775 INFO L89 Accepts]: Start accepts. Operand has 302 places, 2888 transitions, 190577 flow [2022-12-13 03:50:17,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:17,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:17,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 2888 transitions, 190577 flow [2022-12-13 03:50:17,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 2888 transitions, 190577 flow [2022-12-13 03:50:17,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:17,904 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:50:17,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 03:50:17,905 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 2888 transitions, 190577 flow [2022-12-13 03:50:17,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:50:17,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:17,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:17,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 03:50:17,906 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-13 03:50:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1917302555, now seen corresponding path program 17 times [2022-12-13 03:50:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:17,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309506521] [2022-12-13 03:50:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:18,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309506521] [2022-12-13 03:50:18,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309506521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:50:18,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:50:18,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:50:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145208398] [2022-12-13 03:50:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:50:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:50:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:50:18,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:50:18,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:50:18,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:50:18,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 2888 transitions, 190577 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:50:18,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:50:18,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:50:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:50:33,609 INFO L130 PetriNetUnfolder]: 15238/22466 cut-off events. [2022-12-13 03:50:33,609 INFO L131 PetriNetUnfolder]: For 46087/46087 co-relation queries the response was YES. [2022-12-13 03:50:33,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751673 conditions, 22466 events. 15238/22466 cut-off events. For 46087/46087 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 140951 event pairs, 425 based on Foata normal form. 1/17952 useless extension candidates. Maximal degree in co-relation 303001. Up to 21789 conditions per place. [2022-12-13 03:50:34,007 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2717 selfloop transitions, 221 changer transitions 7/2945 dead transitions. [2022-12-13 03:50:34,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 2945 transitions, 200292 flow [2022-12-13 03:50:34,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:50:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:50:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2022-12-13 03:50:34,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3613595706618962 [2022-12-13 03:50:34,009 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 276 predicate places. [2022-12-13 03:50:34,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 314 places, 2945 transitions, 200292 flow [2022-12-13 03:50:34,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 2938 transitions, 199807 flow [2022-12-13 03:50:34,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:50:34,513 INFO L89 Accepts]: Start accepts. Operand has 313 places, 2938 transitions, 199807 flow [2022-12-13 03:50:34,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:34,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:34,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 2938 transitions, 199807 flow [2022-12-13 03:50:34,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 2938 transitions, 199807 flow [2022-12-13 03:50:34,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:34,658 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:50:34,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 03:50:34,659 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 2938 transitions, 199807 flow [2022-12-13 03:50:34,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:50:34,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:34,660 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:34,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 03:50:34,660 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-13 03:50:34,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -177656917, now seen corresponding path program 18 times [2022-12-13 03:50:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:34,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963175028] [2022-12-13 03:50:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963175028] [2022-12-13 03:50:35,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963175028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:50:35,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:50:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:50:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199053639] [2022-12-13 03:50:35,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:50:35,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:50:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:50:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:50:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:50:35,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:50:35,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 2938 transitions, 199807 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:50:35,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:50:35,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:50:35,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:50:50,852 INFO L130 PetriNetUnfolder]: 15243/22477 cut-off events. [2022-12-13 03:50:50,852 INFO L131 PetriNetUnfolder]: For 46095/46095 co-relation queries the response was YES. [2022-12-13 03:50:50,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774527 conditions, 22477 events. 15243/22477 cut-off events. For 46095/46095 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 141092 event pairs, 383 based on Foata normal form. 1/17963 useless extension candidates. Maximal degree in co-relation 312305. Up to 21800 conditions per place. [2022-12-13 03:50:51,130 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 2722 selfloop transitions, 222 changer transitions 7/2951 dead transitions. [2022-12-13 03:50:51,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 2951 transitions, 206608 flow [2022-12-13 03:50:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:50:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:50:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 195 transitions. [2022-12-13 03:50:51,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3488372093023256 [2022-12-13 03:50:51,131 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 287 predicate places. [2022-12-13 03:50:51,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 2951 transitions, 206608 flow [2022-12-13 03:50:51,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 2944 transitions, 206109 flow [2022-12-13 03:50:51,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:50:51,749 INFO L89 Accepts]: Start accepts. Operand has 324 places, 2944 transitions, 206109 flow [2022-12-13 03:50:51,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:50:51,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:50:51,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 2944 transitions, 206109 flow [2022-12-13 03:50:51,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 2944 transitions, 206109 flow [2022-12-13 03:50:51,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:50:51,863 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:50:51,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 03:50:51,864 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 2944 transitions, 206109 flow [2022-12-13 03:50:51,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:50:51,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:50:51,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:50:51,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 03:50:51,865 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-13 03:50:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:50:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1745014691, now seen corresponding path program 19 times [2022-12-13 03:50:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:50:51,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414764114] [2022-12-13 03:50:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:50:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:50:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:50:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:50:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:50:52,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414764114] [2022-12-13 03:50:52,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414764114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:50:52,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:50:52,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:50:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918208264] [2022-12-13 03:50:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:50:52,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:50:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:50:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:50:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:50:52,500 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:50:52,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 2944 transitions, 206109 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:50:52,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:50:52,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:50:52,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:51:09,475 INFO L130 PetriNetUnfolder]: 15530/22969 cut-off events. [2022-12-13 03:51:09,475 INFO L131 PetriNetUnfolder]: For 46234/46234 co-relation queries the response was YES. [2022-12-13 03:51:09,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814642 conditions, 22969 events. 15530/22969 cut-off events. For 46234/46234 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 145570 event pairs, 395 based on Foata normal form. 1/18366 useless extension candidates. Maximal degree in co-relation 336830. Up to 22292 conditions per place. [2022-12-13 03:51:09,908 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2891 selfloop transitions, 201 changer transitions 12/3104 dead transitions. [2022-12-13 03:51:09,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 3104 transitions, 223593 flow [2022-12-13 03:51:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:51:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:51:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 202 transitions. [2022-12-13 03:51:09,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3613595706618962 [2022-12-13 03:51:09,910 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 298 predicate places. [2022-12-13 03:51:09,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 3104 transitions, 223593 flow [2022-12-13 03:51:10,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 334 places, 3092 transitions, 222731 flow [2022-12-13 03:51:10,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:51:10,553 INFO L89 Accepts]: Start accepts. Operand has 334 places, 3092 transitions, 222731 flow [2022-12-13 03:51:10,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:51:10,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:51:10,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 3092 transitions, 222731 flow [2022-12-13 03:51:10,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 3092 transitions, 222731 flow [2022-12-13 03:51:10,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:51:10,677 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:51:10,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 03:51:10,678 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 3092 transitions, 222731 flow [2022-12-13 03:51:10,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:51:10,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:51:10,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:51:10,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 03:51:10,678 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-13 03:51:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:51:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 305933463, now seen corresponding path program 20 times [2022-12-13 03:51:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:51:10,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992284654] [2022-12-13 03:51:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:51:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:51:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:51:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:51:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:51:11,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992284654] [2022-12-13 03:51:11,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992284654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:51:11,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:51:11,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:51:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254802012] [2022-12-13 03:51:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:51:11,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:51:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:51:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:51:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:51:11,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:51:11,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 3092 transitions, 222731 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:51:11,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:51:11,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:51:11,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:51:29,529 INFO L130 PetriNetUnfolder]: 15519/22954 cut-off events. [2022-12-13 03:51:29,529 INFO L131 PetriNetUnfolder]: For 43615/43615 co-relation queries the response was YES. [2022-12-13 03:51:29,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837084 conditions, 22954 events. 15519/22954 cut-off events. For 43615/43615 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 145417 event pairs, 409 based on Foata normal form. 1/18355 useless extension candidates. Maximal degree in co-relation 345799. Up to 22277 conditions per place. [2022-12-13 03:51:29,926 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 2888 selfloop transitions, 203 changer transitions 7/3098 dead transitions. [2022-12-13 03:51:29,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 3098 transitions, 229368 flow [2022-12-13 03:51:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:51:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:51:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 205 transitions. [2022-12-13 03:51:29,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3667262969588551 [2022-12-13 03:51:29,928 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 308 predicate places. [2022-12-13 03:51:29,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 3098 transitions, 229368 flow [2022-12-13 03:51:30,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 345 places, 3091 transitions, 228841 flow [2022-12-13 03:51:30,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:51:30,580 INFO L89 Accepts]: Start accepts. Operand has 345 places, 3091 transitions, 228841 flow [2022-12-13 03:51:30,617 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:51:30,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:51:30,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 3091 transitions, 228841 flow [2022-12-13 03:51:30,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 3091 transitions, 228841 flow [2022-12-13 03:51:30,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:51:30,709 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:51:30,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 03:51:30,710 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 3091 transitions, 228841 flow [2022-12-13 03:51:30,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:51:30,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:51:30,710 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:51:30,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 03:51:30,710 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-13 03:51:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:51:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 831014253, now seen corresponding path program 21 times [2022-12-13 03:51:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:51:30,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47597732] [2022-12-13 03:51:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:51:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:51:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:51:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:51:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:51:31,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47597732] [2022-12-13 03:51:31,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47597732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:51:31,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:51:31,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:51:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621049701] [2022-12-13 03:51:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:51:31,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:51:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:51:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:51:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:51:31,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:51:31,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3091 transitions, 228841 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:51:31,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:51:31,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:51:31,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:51:51,878 INFO L130 PetriNetUnfolder]: 15514/22941 cut-off events. [2022-12-13 03:51:51,878 INFO L131 PetriNetUnfolder]: For 46214/46214 co-relation queries the response was YES. [2022-12-13 03:51:51,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859542 conditions, 22941 events. 15514/22941 cut-off events. For 46214/46214 co-relation queries the response was YES. Maximal size of possible extension queue 979. Compared 145293 event pairs, 425 based on Foata normal form. 1/18348 useless extension candidates. Maximal degree in co-relation 355014. Up to 22264 conditions per place. [2022-12-13 03:51:52,184 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 2877 selfloop transitions, 202 changer transitions 11/3090 dead transitions. [2022-12-13 03:51:52,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 3090 transitions, 234947 flow [2022-12-13 03:51:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:51:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:51:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2022-12-13 03:51:52,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35778175313059035 [2022-12-13 03:51:52,185 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 319 predicate places. [2022-12-13 03:51:52,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 3090 transitions, 234947 flow [2022-12-13 03:51:52,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 355 places, 3079 transitions, 234099 flow [2022-12-13 03:51:52,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:51:52,957 INFO L89 Accepts]: Start accepts. Operand has 355 places, 3079 transitions, 234099 flow [2022-12-13 03:51:52,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:51:52,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:51:52,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 355 places, 3079 transitions, 234099 flow [2022-12-13 03:51:53,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 355 places, 3079 transitions, 234099 flow [2022-12-13 03:51:53,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:51:53,083 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:51:53,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 03:51:53,084 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 3079 transitions, 234099 flow [2022-12-13 03:51:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:51:53,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:51:53,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:51:53,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 03:51:53,085 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-13 03:51:53,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:51:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1642774379, now seen corresponding path program 22 times [2022-12-13 03:51:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:51:53,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458246762] [2022-12-13 03:51:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:51:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:51:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:51:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:51:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:51:54,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458246762] [2022-12-13 03:51:54,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458246762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:51:54,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:51:54,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:51:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460902682] [2022-12-13 03:51:54,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:51:54,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:51:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:51:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:51:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:51:54,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:51:54,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 3079 transitions, 234099 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:51:54,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:51:54,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:51:54,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:52:12,432 INFO L130 PetriNetUnfolder]: 15507/22930 cut-off events. [2022-12-13 03:52:12,433 INFO L131 PetriNetUnfolder]: For 48819/48819 co-relation queries the response was YES. [2022-12-13 03:52:12,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882054 conditions, 22930 events. 15507/22930 cut-off events. For 48819/48819 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 145248 event pairs, 411 based on Foata normal form. 1/18341 useless extension candidates. Maximal degree in co-relation 364059. Up to 22253 conditions per place. [2022-12-13 03:52:12,833 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2882 selfloop transitions, 191 changer transitions 12/3085 dead transitions. [2022-12-13 03:52:12,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 3085 transitions, 240734 flow [2022-12-13 03:52:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:52:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:52:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 198 transitions. [2022-12-13 03:52:12,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3542039355992844 [2022-12-13 03:52:12,835 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 329 predicate places. [2022-12-13 03:52:12,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 3085 transitions, 240734 flow [2022-12-13 03:52:13,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 3073 transitions, 239800 flow [2022-12-13 03:52:13,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:52:13,515 INFO L89 Accepts]: Start accepts. Operand has 365 places, 3073 transitions, 239800 flow [2022-12-13 03:52:13,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:52:13,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:52:13,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 365 places, 3073 transitions, 239800 flow [2022-12-13 03:52:13,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 365 places, 3073 transitions, 239800 flow [2022-12-13 03:52:13,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:52:13,651 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:52:13,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 03:52:13,653 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 3073 transitions, 239800 flow [2022-12-13 03:52:13,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:52:13,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:52:13,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:52:13,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 03:52:13,655 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-13 03:52:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:52:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash -601244763, now seen corresponding path program 23 times [2022-12-13 03:52:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:52:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015639064] [2022-12-13 03:52:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:52:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:52:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:52:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:52:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:52:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015639064] [2022-12-13 03:52:14,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015639064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:52:14,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:52:14,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:52:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108879766] [2022-12-13 03:52:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:52:14,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:52:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:52:14,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:52:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:52:14,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:52:14,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 3073 transitions, 239800 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:52:14,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:52:14,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:52:14,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:52:32,276 INFO L130 PetriNetUnfolder]: 15497/22908 cut-off events. [2022-12-13 03:52:32,278 INFO L131 PetriNetUnfolder]: For 48809/48809 co-relation queries the response was YES. [2022-12-13 03:52:32,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904129 conditions, 22908 events. 15497/22908 cut-off events. For 48809/48809 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 145018 event pairs, 417 based on Foata normal form. 1/18323 useless extension candidates. Maximal degree in co-relation 372829. Up to 22231 conditions per place. [2022-12-13 03:52:32,593 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2873 selfloop transitions, 192 changer transitions 7/3072 dead transitions. [2022-12-13 03:52:32,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 3072 transitions, 245866 flow [2022-12-13 03:52:32,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:52:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:52:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 194 transitions. [2022-12-13 03:52:32,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3470483005366726 [2022-12-13 03:52:32,594 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 339 predicate places. [2022-12-13 03:52:32,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 3072 transitions, 245866 flow [2022-12-13 03:52:32,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 376 places, 3065 transitions, 245297 flow [2022-12-13 03:52:33,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:52:33,338 INFO L89 Accepts]: Start accepts. Operand has 376 places, 3065 transitions, 245297 flow [2022-12-13 03:52:33,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:52:33,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:52:33,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 376 places, 3065 transitions, 245297 flow [2022-12-13 03:52:33,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 376 places, 3065 transitions, 245297 flow [2022-12-13 03:52:33,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:52:33,468 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:52:33,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 03:52:33,469 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 3065 transitions, 245297 flow [2022-12-13 03:52:33,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:52:33,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:52:33,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:52:33,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 03:52:33,469 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-13 03:52:33,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:52:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2125342373, now seen corresponding path program 24 times [2022-12-13 03:52:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:52:33,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721551360] [2022-12-13 03:52:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:52:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:52:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:52:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:52:34,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:52:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721551360] [2022-12-13 03:52:34,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721551360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:52:34,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:52:34,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:52:34,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341568796] [2022-12-13 03:52:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:52:34,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:52:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:52:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:52:34,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:52:34,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:52:34,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 3065 transitions, 245297 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:52:34,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:52:34,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:52:34,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:52:52,932 INFO L130 PetriNetUnfolder]: 15494/22909 cut-off events. [2022-12-13 03:52:52,932 INFO L131 PetriNetUnfolder]: For 43598/43598 co-relation queries the response was YES. [2022-12-13 03:52:52,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927080 conditions, 22909 events. 15494/22909 cut-off events. For 43598/43598 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 145080 event pairs, 433 based on Foata normal form. 1/18330 useless extension candidates. Maximal degree in co-relation 382399. Up to 22232 conditions per place. [2022-12-13 03:52:53,369 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2852 selfloop transitions, 211 changer transitions 12/3075 dead transitions. [2022-12-13 03:52:53,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 3075 transitions, 252259 flow [2022-12-13 03:52:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:52:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:52:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2022-12-13 03:52:53,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36493738819320215 [2022-12-13 03:52:53,370 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 350 predicate places. [2022-12-13 03:52:53,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 388 places, 3075 transitions, 252259 flow [2022-12-13 03:52:53,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 386 places, 3063 transitions, 251277 flow [2022-12-13 03:52:54,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:52:54,028 INFO L89 Accepts]: Start accepts. Operand has 386 places, 3063 transitions, 251277 flow [2022-12-13 03:52:54,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:52:54,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:52:54,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 3063 transitions, 251277 flow [2022-12-13 03:52:54,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 386 places, 3063 transitions, 251277 flow [2022-12-13 03:52:54,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:52:54,164 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:52:54,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 03:52:54,165 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 3063 transitions, 251277 flow [2022-12-13 03:52:54,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:52:54,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:52:54,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:52:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 03:52:54,165 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-13 03:52:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:52:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -74394219, now seen corresponding path program 25 times [2022-12-13 03:52:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:52:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004657026] [2022-12-13 03:52:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:52:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:52:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:52:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:52:54,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:52:54,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004657026] [2022-12-13 03:52:54,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004657026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:52:54,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:52:54,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:52:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364730934] [2022-12-13 03:52:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:52:54,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:52:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:52:54,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:52:54,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:52:54,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:52:54,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 3063 transitions, 251277 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:52:54,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:52:54,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:52:54,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:53:13,342 INFO L130 PetriNetUnfolder]: 15516/22945 cut-off events. [2022-12-13 03:53:13,343 INFO L131 PetriNetUnfolder]: For 43613/43613 co-relation queries the response was YES. [2022-12-13 03:53:13,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951535 conditions, 22945 events. 15516/22945 cut-off events. For 43613/43613 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 145363 event pairs, 433 based on Foata normal form. 1/18352 useless extension candidates. Maximal degree in co-relation 392634. Up to 22268 conditions per place. [2022-12-13 03:53:13,665 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 2868 selfloop transitions, 215 changer transitions 7/3090 dead transitions. [2022-12-13 03:53:13,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 3090 transitions, 259698 flow [2022-12-13 03:53:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:53:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:53:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 210 transitions. [2022-12-13 03:53:13,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3488372093023256 [2022-12-13 03:53:13,667 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 361 predicate places. [2022-12-13 03:53:13,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 399 places, 3090 transitions, 259698 flow [2022-12-13 03:53:14,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 398 places, 3083 transitions, 259101 flow [2022-12-13 03:53:14,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:53:14,420 INFO L89 Accepts]: Start accepts. Operand has 398 places, 3083 transitions, 259101 flow [2022-12-13 03:53:14,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:53:14,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:53:14,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 398 places, 3083 transitions, 259101 flow [2022-12-13 03:53:14,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 398 places, 3083 transitions, 259101 flow [2022-12-13 03:53:14,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:53:14,572 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:53:14,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 03:53:14,573 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 3083 transitions, 259101 flow [2022-12-13 03:53:14,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:53:14,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:53:14,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:53:14,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 03:53:14,573 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-13 03:53:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:53:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 450686571, now seen corresponding path program 26 times [2022-12-13 03:53:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:53:14,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298581685] [2022-12-13 03:53:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:53:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:53:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:53:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:53:15,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:53:15,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298581685] [2022-12-13 03:53:15,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298581685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:53:15,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:53:15,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:53:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075782197] [2022-12-13 03:53:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:53:15,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:53:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:53:15,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:53:15,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:53:15,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:53:15,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 3083 transitions, 259101 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:53:15,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:53:15,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:53:15,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:53:34,753 INFO L130 PetriNetUnfolder]: 15511/22932 cut-off events. [2022-12-13 03:53:34,754 INFO L131 PetriNetUnfolder]: For 48818/48818 co-relation queries the response was YES. [2022-12-13 03:53:34,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973919 conditions, 22932 events. 15511/22932 cut-off events. For 48818/48818 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 145295 event pairs, 387 based on Foata normal form. 1/18345 useless extension candidates. Maximal degree in co-relation 401799. Up to 22255 conditions per place. [2022-12-13 03:53:35,213 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2859 selfloop transitions, 212 changer transitions 11/3082 dead transitions. [2022-12-13 03:53:35,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 3082 transitions, 265181 flow [2022-12-13 03:53:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:53:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:53:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2022-12-13 03:53:35,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35778175313059035 [2022-12-13 03:53:35,214 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 372 predicate places. [2022-12-13 03:53:35,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 410 places, 3082 transitions, 265181 flow [2022-12-13 03:53:35,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 408 places, 3071 transitions, 264223 flow [2022-12-13 03:53:35,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:53:35,937 INFO L89 Accepts]: Start accepts. Operand has 408 places, 3071 transitions, 264223 flow [2022-12-13 03:53:35,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:53:35,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:53:35,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 408 places, 3071 transitions, 264223 flow [2022-12-13 03:53:36,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 408 places, 3071 transitions, 264223 flow [2022-12-13 03:53:36,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:53:36,073 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:53:36,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 03:53:36,076 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 3071 transitions, 264223 flow [2022-12-13 03:53:36,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:53:36,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:53:36,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:53:36,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 03:53:36,077 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-13 03:53:36,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:53:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1441051141, now seen corresponding path program 27 times [2022-12-13 03:53:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:53:36,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547062807] [2022-12-13 03:53:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:53:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:53:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:53:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:53:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:53:36,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547062807] [2022-12-13 03:53:36,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547062807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:53:36,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:53:36,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:53:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070791142] [2022-12-13 03:53:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:53:36,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:53:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:53:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:53:36,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:53:36,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:53:36,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 3071 transitions, 264223 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:53:36,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:53:36,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:53:36,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:53:56,229 INFO L130 PetriNetUnfolder]: 15628/23146 cut-off events. [2022-12-13 03:53:56,229 INFO L131 PetriNetUnfolder]: For 43683/43683 co-relation queries the response was YES. [2022-12-13 03:53:56,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006305 conditions, 23146 events. 15628/23146 cut-off events. For 43683/43683 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 147341 event pairs, 412 based on Foata normal form. 1/18517 useless extension candidates. Maximal degree in co-relation 417793. Up to 22469 conditions per place. [2022-12-13 03:53:56,682 INFO L137 encePairwiseOnDemand]: 24/43 looper letters, 2933 selfloop transitions, 233 changer transitions 7/3173 dead transitions. [2022-12-13 03:53:56,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 3173 transitions, 279440 flow [2022-12-13 03:53:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 03:53:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 03:53:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 236 transitions. [2022-12-13 03:53:56,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3228454172366621 [2022-12-13 03:53:56,684 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 386 predicate places. [2022-12-13 03:53:56,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 424 places, 3173 transitions, 279440 flow [2022-12-13 03:53:57,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 424 places, 3166 transitions, 278815 flow [2022-12-13 03:53:57,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:53:57,463 INFO L89 Accepts]: Start accepts. Operand has 424 places, 3166 transitions, 278815 flow [2022-12-13 03:53:57,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:53:57,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:53:57,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 424 places, 3166 transitions, 278815 flow [2022-12-13 03:53:57,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 424 places, 3166 transitions, 278815 flow [2022-12-13 03:53:57,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:53:57,614 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:53:57,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 03:53:57,614 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 3166 transitions, 278815 flow [2022-12-13 03:53:57,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:53:57,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:53:57,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:53:57,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 03:53:57,615 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-13 03:53:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:53:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1871240757, now seen corresponding path program 28 times [2022-12-13 03:53:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:53:57,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605013146] [2022-12-13 03:53:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:53:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:53:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:53:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:53:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:53:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605013146] [2022-12-13 03:53:59,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605013146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:53:59,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:53:59,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:53:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868349932] [2022-12-13 03:53:59,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:53:59,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:53:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:53:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:53:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:53:59,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 03:53:59,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 3166 transitions, 278815 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:53:59,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:53:59,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 03:53:59,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:54:24,092 INFO L130 PetriNetUnfolder]: 17707/26248 cut-off events. [2022-12-13 03:54:24,092 INFO L131 PetriNetUnfolder]: For 48502/48502 co-relation queries the response was YES. [2022-12-13 03:54:24,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166939 conditions, 26248 events. 17707/26248 cut-off events. For 48502/48502 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 170345 event pairs, 416 based on Foata normal form. 1/20920 useless extension candidates. Maximal degree in co-relation 560989. Up to 25461 conditions per place. [2022-12-13 03:54:24,617 INFO L137 encePairwiseOnDemand]: 23/43 looper letters, 3523 selfloop transitions, 266 changer transitions 12/3801 dead transitions. [2022-12-13 03:54:24,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 3801 transitions, 342109 flow [2022-12-13 03:54:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:54:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:54:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 200 transitions. [2022-12-13 03:54:24,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33222591362126247 [2022-12-13 03:54:24,618 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 399 predicate places. [2022-12-13 03:54:24,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 3801 transitions, 342109 flow [2022-12-13 03:54:25,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 3789 transitions, 341031 flow [2022-12-13 03:54:25,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:54:25,520 INFO L89 Accepts]: Start accepts. Operand has 435 places, 3789 transitions, 341031 flow [2022-12-13 03:54:25,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:54:25,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:54:25,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 435 places, 3789 transitions, 341031 flow [2022-12-13 03:54:25,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 435 places, 3789 transitions, 341031 flow [2022-12-13 03:54:25,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:54:30,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:54:30,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4673 [2022-12-13 03:54:30,193 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 3788 transitions, 340941 flow [2022-12-13 03:54:30,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:54:30,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:54:30,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:54:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 03:54:30,194 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-13 03:54:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:54:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -58805453, now seen corresponding path program 29 times [2022-12-13 03:54:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:54:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934418460] [2022-12-13 03:54:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:54:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:54:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:54:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:54:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:54:30,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934418460] [2022-12-13 03:54:30,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934418460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:54:30,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:54:30,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:54:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380438695] [2022-12-13 03:54:30,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:54:30,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:54:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:54:30,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:54:30,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:54:30,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 03:54:30,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 3788 transitions, 340941 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:54:30,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:54:30,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 03:54:30,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:55:03,354 INFO L130 PetriNetUnfolder]: 17899/26538 cut-off events. [2022-12-13 03:55:03,354 INFO L131 PetriNetUnfolder]: For 48500/48500 co-relation queries the response was YES. [2022-12-13 03:55:03,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206440 conditions, 26538 events. 17899/26538 cut-off events. For 48500/48500 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 172529 event pairs, 434 based on Foata normal form. 1/21165 useless extension candidates. Maximal degree in co-relation 586725. Up to 25751 conditions per place. [2022-12-13 03:55:03,769 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 3698 selfloop transitions, 194 changer transitions 12/3904 dead transitions. [2022-12-13 03:55:03,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 3904 transitions, 359039 flow [2022-12-13 03:55:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:55:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:55:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2022-12-13 03:55:03,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32517482517482516 [2022-12-13 03:55:03,770 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 408 predicate places. [2022-12-13 03:55:03,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 3904 transitions, 359039 flow [2022-12-13 03:55:04,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 444 places, 3892 transitions, 357937 flow [2022-12-13 03:55:04,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:55:04,760 INFO L89 Accepts]: Start accepts. Operand has 444 places, 3892 transitions, 357937 flow [2022-12-13 03:55:04,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:55:04,800 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:55:04,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 444 places, 3892 transitions, 357937 flow [2022-12-13 03:55:04,931 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 444 places, 3892 transitions, 357937 flow [2022-12-13 03:55:04,931 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:55:04,941 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:55:04,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-13 03:55:04,942 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 3892 transitions, 357937 flow [2022-12-13 03:55:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:55:04,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:55:04,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:55:04,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 03:55:04,942 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-13 03:55:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:55:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1805532365, now seen corresponding path program 30 times [2022-12-13 03:55:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:55:04,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561500026] [2022-12-13 03:55:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:55:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:05,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:55:05,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:55:05,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561500026] [2022-12-13 03:55:05,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561500026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:55:05,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:55:05,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:55:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674486283] [2022-12-13 03:55:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:55:05,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:55:05,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:55:05,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:55:05,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:55:05,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 03:55:05,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 3892 transitions, 357937 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:55:05,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:55:05,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 03:55:05,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:55:38,389 INFO L130 PetriNetUnfolder]: 18146/26942 cut-off events. [2022-12-13 03:55:38,389 INFO L131 PetriNetUnfolder]: For 45509/45509 co-relation queries the response was YES. [2022-12-13 03:55:38,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1251901 conditions, 26942 events. 18146/26942 cut-off events. For 45509/45509 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 176097 event pairs, 464 based on Foata normal form. 1/21492 useless extension candidates. Maximal degree in co-relation 617423. Up to 26155 conditions per place. [2022-12-13 03:55:38,933 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 3772 selfloop transitions, 216 changer transitions 11/3999 dead transitions. [2022-12-13 03:55:38,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 3999 transitions, 375770 flow [2022-12-13 03:55:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:55:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:55:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 192 transitions. [2022-12-13 03:55:38,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3356643356643357 [2022-12-13 03:55:38,935 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 418 predicate places. [2022-12-13 03:55:38,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 3999 transitions, 375770 flow [2022-12-13 03:55:39,454 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 454 places, 3988 transitions, 374724 flow [2022-12-13 03:55:39,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:55:39,941 INFO L89 Accepts]: Start accepts. Operand has 454 places, 3988 transitions, 374724 flow [2022-12-13 03:55:39,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:55:39,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:55:39,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 454 places, 3988 transitions, 374724 flow [2022-12-13 03:55:40,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 454 places, 3988 transitions, 374724 flow [2022-12-13 03:55:40,129 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:55:40,141 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:55:40,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-13 03:55:40,141 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 3988 transitions, 374724 flow [2022-12-13 03:55:40,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:55:40,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:55:40,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:55:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 03:55:40,142 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-13 03:55:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:55:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash 706410827, now seen corresponding path program 31 times [2022-12-13 03:55:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:55:40,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364533312] [2022-12-13 03:55:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:55:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:55:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:55:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:55:41,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:55:41,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364533312] [2022-12-13 03:55:41,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364533312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:55:41,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:55:41,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:55:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883154279] [2022-12-13 03:55:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:55:41,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:55:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:55:41,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:55:41,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:55:41,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 03:55:41,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 3988 transitions, 374724 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:55:41,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:55:41,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 03:55:41,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:56:14,206 INFO L130 PetriNetUnfolder]: 18184/27040 cut-off events. [2022-12-13 03:56:14,206 INFO L131 PetriNetUnfolder]: For 45559/45559 co-relation queries the response was YES. [2022-12-13 03:56:14,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1283571 conditions, 27040 events. 18184/27040 cut-off events. For 45559/45559 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 177382 event pairs, 464 based on Foata normal form. 1/21570 useless extension candidates. Maximal degree in co-relation 633316. Up to 26253 conditions per place. [2022-12-13 03:56:14,627 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 3825 selfloop transitions, 216 changer transitions 7/4048 dead transitions. [2022-12-13 03:56:14,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 4048 transitions, 388526 flow [2022-12-13 03:56:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:56:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:56:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2022-12-13 03:56:14,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3479020979020979 [2022-12-13 03:56:14,629 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 428 predicate places. [2022-12-13 03:56:14,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 4048 transitions, 388526 flow [2022-12-13 03:56:15,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 465 places, 4041 transitions, 387845 flow [2022-12-13 03:56:15,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:56:15,673 INFO L89 Accepts]: Start accepts. Operand has 465 places, 4041 transitions, 387845 flow [2022-12-13 03:56:15,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:56:15,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:56:15,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 465 places, 4041 transitions, 387845 flow [2022-12-13 03:56:15,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 465 places, 4041 transitions, 387845 flow [2022-12-13 03:56:15,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:56:15,876 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:56:15,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 03:56:15,876 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 4041 transitions, 387845 flow [2022-12-13 03:56:15,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:56:15,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:56:15,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:56:15,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 03:56:15,877 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-13 03:56:15,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:56:15,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1388548645, now seen corresponding path program 32 times [2022-12-13 03:56:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:56:15,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677921712] [2022-12-13 03:56:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:56:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:56:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:56:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:56:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:56:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677921712] [2022-12-13 03:56:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677921712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:56:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:56:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 03:56:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517942147] [2022-12-13 03:56:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:56:16,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 03:56:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:56:16,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 03:56:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 03:56:16,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 03:56:16,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 4041 transitions, 387845 flow. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:56:16,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:56:16,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 03:56:16,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:56:48,595 INFO L130 PetriNetUnfolder]: 18200/27068 cut-off events. [2022-12-13 03:56:48,595 INFO L131 PetriNetUnfolder]: For 45560/45560 co-relation queries the response was YES. [2022-12-13 03:56:48,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311988 conditions, 27068 events. 18200/27068 cut-off events. For 45560/45560 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 177725 event pairs, 464 based on Foata normal form. 1/21592 useless extension candidates. Maximal degree in co-relation 647545. Up to 26281 conditions per place. [2022-12-13 03:56:49,241 INFO L137 encePairwiseOnDemand]: 24/44 looper letters, 3835 selfloop transitions, 219 changer transitions 7/4061 dead transitions. [2022-12-13 03:56:49,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 4061 transitions, 397908 flow [2022-12-13 03:56:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 03:56:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 03:56:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 201 transitions. [2022-12-13 03:56:49,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3262987012987013 [2022-12-13 03:56:49,242 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 440 predicate places. [2022-12-13 03:56:49,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 478 places, 4061 transitions, 397908 flow [2022-12-13 03:56:49,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 477 places, 4054 transitions, 397213 flow [2022-12-13 03:56:50,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:56:50,280 INFO L89 Accepts]: Start accepts. Operand has 477 places, 4054 transitions, 397213 flow [2022-12-13 03:56:50,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:56:50,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:56:50,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 477 places, 4054 transitions, 397213 flow [2022-12-13 03:56:50,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 477 places, 4054 transitions, 397213 flow [2022-12-13 03:56:50,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:56:50,608 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:56:50,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-13 03:56:50,609 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 4054 transitions, 397213 flow [2022-12-13 03:56:50,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 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-13 03:56:50,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:56:50,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:56:50,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 03:56:50,610 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-13 03:56:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:56:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash 958733195, now seen corresponding path program 33 times [2022-12-13 03:56:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:56:50,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088286938] [2022-12-13 03:56:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:56:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:56:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:56:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:56:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:56:51,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088286938] [2022-12-13 03:56:51,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088286938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:56:51,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:56:51,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 03:56:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34928132] [2022-12-13 03:56:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:56:51,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 03:56:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:56:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 03:56:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 03:56:51,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 03:56:51,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 4054 transitions, 397213 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:56:51,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:56:51,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 03:56:51,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:57:28,657 INFO L130 PetriNetUnfolder]: 18295/27235 cut-off events. [2022-12-13 03:57:28,658 INFO L131 PetriNetUnfolder]: For 48254/48254 co-relation queries the response was YES. [2022-12-13 03:57:28,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347372 conditions, 27235 events. 18295/27235 cut-off events. For 48254/48254 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 179196 event pairs, 442 based on Foata normal form. 1/21725 useless extension candidates. Maximal degree in co-relation 668317. Up to 26448 conditions per place. [2022-12-13 03:57:29,363 INFO L137 encePairwiseOnDemand]: 25/44 looper letters, 3896 selfloop transitions, 212 changer transitions 12/4120 dead transitions. [2022-12-13 03:57:29,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 4120 transitions, 411947 flow [2022-12-13 03:57:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:57:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 03:57:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 199 transitions. [2022-12-13 03:57:29,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3479020979020979 [2022-12-13 03:57:29,365 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 451 predicate places. [2022-12-13 03:57:29,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 489 places, 4120 transitions, 411947 flow [2022-12-13 03:57:30,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 4108 transitions, 410749 flow [2022-12-13 03:57:30,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:57:30,519 INFO L89 Accepts]: Start accepts. Operand has 487 places, 4108 transitions, 410749 flow [2022-12-13 03:57:30,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:57:30,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:57:30,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 487 places, 4108 transitions, 410749 flow [2022-12-13 03:57:30,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 487 places, 4108 transitions, 410749 flow [2022-12-13 03:57:30,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:57:30,767 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:57:30,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-13 03:57:30,768 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 4108 transitions, 410749 flow [2022-12-13 03:57:30,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 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-13 03:57:30,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:57:30,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:30,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 03:57:30,768 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-13 03:57:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:57:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1285285947, now seen corresponding path program 34 times [2022-12-13 03:57:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:57:30,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364727712] [2022-12-13 03:57:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:57:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:57:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:57:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:57:31,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:57:31,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364727712] [2022-12-13 03:57:31,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364727712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:57:31,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:57:31,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 03:57:31,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87774736] [2022-12-13 03:57:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:57:31,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 03:57:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:57:31,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 03:57:31,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 03:57:31,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 03:57:31,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 4108 transitions, 410749 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 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-13 03:57:31,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:57:31,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 03:57:31,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 03:57:58,937 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 [2022-12-13 03:57:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 03:57:58,966 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:57:58,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 03:57:58,966 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/44 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 1070685 conditions, 21214 events (14700/21213 cut-off events. For 40255/40255 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 137413 event pairs, 326 based on Foata normal form. 0/17628 useless extension candidates. Maximal degree in co-relation 565486. Up to 20568 conditions per place.). [2022-12-13 03:57:58,967 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:57:58,967 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:57:58,967 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:57:58,968 INFO L445 BasicCegarLoop]: Path program histogram: [34, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:57:58,970 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:57:58,970 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:57:58,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:57:58 BasicIcfg [2022-12-13 03:57:58,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:57:58,973 INFO L158 Benchmark]: Toolchain (without parser) took 760229.06ms. Allocated memory was 195.0MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 171.3MB in the beginning and 826.6MB in the end (delta: -655.3MB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2022-12-13 03:57:58,973 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:57:58,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.20ms. Allocated memory is still 195.0MB. Free memory was 170.9MB in the beginning and 158.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 03:57:58,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.89ms. Allocated memory is still 195.0MB. Free memory was 158.9MB in the beginning and 156.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:57:58,973 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 195.0MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:57:58,973 INFO L158 Benchmark]: RCFGBuilder took 668.22ms. Allocated memory is still 195.0MB. Free memory was 154.2MB in the beginning and 130.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-13 03:57:58,974 INFO L158 Benchmark]: TraceAbstraction took 759146.67ms. Allocated memory was 195.0MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 128.5MB in the beginning and 826.6MB in the end (delta: -698.1MB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2022-12-13 03:57:58,974 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 195.0MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.20ms. Allocated memory is still 195.0MB. Free memory was 170.9MB in the beginning and 158.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.89ms. Allocated memory is still 195.0MB. Free memory was 158.9MB in the beginning and 156.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 195.0MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 668.22ms. Allocated memory is still 195.0MB. Free memory was 154.2MB in the beginning and 130.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 759146.67ms. Allocated memory was 195.0MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 128.5MB in the beginning and 826.6MB in the end (delta: -698.1MB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 281 PlacesBefore, 38 PlacesAfterwards, 299 TransitionsBefore, 36 TransitionsAfterwards, 14784 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 126 TrivialYvCompositions, 117 ConcurrentYvCompositions, 20 ChoiceCompositions, 263 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 9901, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 0, independent unconditional: 9901, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 0, independent unconditional: 9901, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9967, independent: 9901, independent conditional: 0, independent unconditional: 9901, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8995, independent: 8953, independent conditional: 0, independent unconditional: 8953, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8995, independent: 8953, independent conditional: 0, independent unconditional: 8953, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9967, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 8995, unknown conditional: 0, unknown unconditional: 8995] , Statistics on independence cache: Total cache size (in pairs): 17857, Positive cache size: 17815, Positive conditional cache size: 0, Positive unconditional cache size: 17815, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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: 1.1s, 45 PlacesBefore, 44 PlacesAfterwards, 136 TransitionsBefore, 135 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 54, independent unconditional: 60, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 114, independent conditional: 36, independent unconditional: 78, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 114, independent conditional: 36, independent unconditional: 78, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 4, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 99, independent conditional: 32, independent unconditional: 67, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 18, unknown conditional: 4, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 4, Positive unconditional cache size: 11, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 283 TransitionsBefore, 283 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 4, Positive unconditional cache size: 12, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 58 PlacesAfterwards, 508 TransitionsBefore, 508 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 893, independent: 874, independent conditional: 874, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 893, independent: 874, independent conditional: 874, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 931, independent: 874, independent conditional: 608, independent unconditional: 266, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 931, independent: 874, independent conditional: 608, independent unconditional: 266, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 24, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 931, independent: 844, independent conditional: 584, independent unconditional: 260, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 31, unknown conditional: 24, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 46, Positive conditional cache size: 28, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 323, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 53 PlacesBefore, 52 PlacesAfterwards, 197 TransitionsBefore, 196 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 48, Positive conditional cache size: 30, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 58 PlacesBefore, 57 PlacesAfterwards, 310 TransitionsBefore, 309 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 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: 2, independent: 2, independent conditional: 2, 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): 52, Positive cache size: 48, Positive conditional cache size: 30, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 53 PlacesBefore, 52 PlacesAfterwards, 199 TransitionsBefore, 198 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 59 PlacesBefore, 57 PlacesAfterwards, 200 TransitionsBefore, 198 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 60 PlacesBefore, 60 PlacesAfterwards, 333 TransitionsBefore, 333 TransitionsAfterwards, 6 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 64 PlacesBefore, 64 PlacesAfterwards, 377 TransitionsBefore, 377 TransitionsAfterwards, 10 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 68 PlacesBefore, 68 PlacesAfterwards, 427 TransitionsBefore, 427 TransitionsAfterwards, 12 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 72 PlacesBefore, 72 PlacesAfterwards, 476 TransitionsBefore, 476 TransitionsAfterwards, 12 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 82 PlacesBefore, 82 PlacesAfterwards, 801 TransitionsBefore, 801 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 94 PlacesBefore, 94 PlacesAfterwards, 1052 TransitionsBefore, 1052 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 105 PlacesBefore, 105 PlacesAfterwards, 1214 TransitionsBefore, 1214 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 116 PlacesBefore, 116 PlacesAfterwards, 1220 TransitionsBefore, 1220 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 5.3s, 127 PlacesBefore, 126 PlacesAfterwards, 2202 TransitionsBefore, 2201 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 137 PlacesBefore, 137 PlacesAfterwards, 2200 TransitionsBefore, 2200 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 147 PlacesBefore, 147 PlacesAfterwards, 2188 TransitionsBefore, 2188 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 160 PlacesBefore, 160 PlacesAfterwards, 2478 TransitionsBefore, 2478 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 170 PlacesBefore, 170 PlacesAfterwards, 2478 TransitionsBefore, 2478 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 180 PlacesBefore, 180 PlacesAfterwards, 2514 TransitionsBefore, 2514 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 191 PlacesBefore, 191 PlacesAfterwards, 2506 TransitionsBefore, 2506 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 206 PlacesBefore, 206 PlacesAfterwards, 2820 TransitionsBefore, 2820 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 216 PlacesBefore, 216 PlacesAfterwards, 2844 TransitionsBefore, 2844 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 226 PlacesBefore, 226 PlacesAfterwards, 2831 TransitionsBefore, 2831 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 237 PlacesBefore, 237 PlacesAfterwards, 2830 TransitionsBefore, 2830 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 247 PlacesBefore, 247 PlacesAfterwards, 2818 TransitionsBefore, 2818 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 257 PlacesBefore, 257 PlacesAfterwards, 2840 TransitionsBefore, 2840 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 269 PlacesBefore, 269 PlacesAfterwards, 2907 TransitionsBefore, 2907 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 280 PlacesBefore, 280 PlacesAfterwards, 2906 TransitionsBefore, 2906 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 292 PlacesBefore, 292 PlacesAfterwards, 2901 TransitionsBefore, 2901 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 302 PlacesBefore, 302 PlacesAfterwards, 2888 TransitionsBefore, 2888 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 313 PlacesBefore, 313 PlacesAfterwards, 2938 TransitionsBefore, 2938 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 324 PlacesBefore, 324 PlacesAfterwards, 2944 TransitionsBefore, 2944 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 334 PlacesBefore, 334 PlacesAfterwards, 3092 TransitionsBefore, 3092 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 345 PlacesBefore, 345 PlacesAfterwards, 3091 TransitionsBefore, 3091 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 355 PlacesBefore, 355 PlacesAfterwards, 3079 TransitionsBefore, 3079 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 365 PlacesBefore, 365 PlacesAfterwards, 3073 TransitionsBefore, 3073 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 376 PlacesBefore, 376 PlacesAfterwards, 3065 TransitionsBefore, 3065 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 386 PlacesBefore, 386 PlacesAfterwards, 3063 TransitionsBefore, 3063 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 398 PlacesBefore, 398 PlacesAfterwards, 3083 TransitionsBefore, 3083 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 408 PlacesBefore, 408 PlacesAfterwards, 3071 TransitionsBefore, 3071 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 424 PlacesBefore, 424 PlacesAfterwards, 3166 TransitionsBefore, 3166 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 4.5s, 435 PlacesBefore, 434 PlacesAfterwards, 3789 TransitionsBefore, 3788 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 444 PlacesBefore, 444 PlacesAfterwards, 3892 TransitionsBefore, 3892 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 454 PlacesBefore, 454 PlacesAfterwards, 3988 TransitionsBefore, 3988 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 465 PlacesBefore, 465 PlacesAfterwards, 4041 TransitionsBefore, 4041 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 477 PlacesBefore, 477 PlacesAfterwards, 4054 TransitionsBefore, 4054 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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, 487 PlacesBefore, 487 PlacesAfterwards, 4108 TransitionsBefore, 4108 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 33, Positive unconditional cache size: 18, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/44 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 1070685 conditions, 21214 events (14700/21213 cut-off events. For 40255/40255 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 137413 event pairs, 326 based on Foata normal form. 0/17628 useless extension candidates. Maximal degree in co-relation 565486. Up to 20568 conditions per place.). - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/44 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 1070685 conditions, 21214 events (14700/21213 cut-off events. For 40255/40255 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 137413 event pairs, 326 based on Foata normal form. 0/17628 useless extension candidates. Maximal degree in co-relation 565486. Up to 20568 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/44 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 1070685 conditions, 21214 events (14700/21213 cut-off events. For 40255/40255 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 137413 event pairs, 326 based on Foata normal form. 0/17628 useless extension candidates. Maximal degree in co-relation 565486. Up to 20568 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (13states, 0/44 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 1070685 conditions, 21214 events (14700/21213 cut-off events. For 40255/40255 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 137413 event pairs, 326 based on Foata normal form. 0/17628 useless extension candidates. Maximal degree in co-relation 565486. Up to 20568 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 408 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: 759.0s, OverallIterations: 50, TraceHistogramMax: 1, PathProgramHistogramMax: 34, EmptinessCheckTime: 0.0s, AutomataDifference: 650.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9450 SdHoareTripleChecker+Valid, 21.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9450 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 18.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34572 IncrementalHoareTripleChecker+Invalid, 34960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 3 mSDtfsCounter, 34572 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 805 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410749occurred in iteration=49, InterpolantAutomatonStates: 585, 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.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 39.8s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1229 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1221 ConstructedInterpolants, 0 QuantifiedInterpolants, 24600 SizeOfPredicates, 61 NumberOfNonLiveVariables, 863 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 55 InterpolantComputations, 49 PerfectInterpolantSequences, 4/10 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