/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/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:09:18,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:09:18,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:09:18,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:09:18,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:09:18,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:09:18,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:09:18,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:09:18,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:09:18,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:09:18,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:09:18,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:09:18,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:09:18,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:09:18,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:09:18,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:09:18,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:09:18,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:09:18,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:09:18,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:09:18,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:09:18,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:09:18,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:09:18,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:09:18,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:09:18,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:09:18,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:09:18,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:09:18,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:09:18,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:09:18,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:09:18,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:09:18,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:09:18,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:09:18,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:09:18,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:09:18,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:09:18,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:09:18,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:09:18,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:09:18,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:09:18,656 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-06 01:09:18,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:09:18,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:09:18,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:09:18,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:09:18,691 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:09:18,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:09:18,696 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:09:18,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:09:18,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:09:18,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:09:18,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:09:18,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:09:18,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:09:18,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:09:18,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:09:18,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:09:18,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:09:18,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:09:18,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:09:18,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:09:18,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:09:18,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:09:18,699 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-06 01:09:19,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:09:19,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:09:19,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:09:19,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:09:19,055 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:09:19,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2022-12-06 01:09:20,146 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:09:20,406 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:09:20,406 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2022-12-06 01:09:20,418 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4a463f7/7c900dfae1044a3689251feb81acffed/FLAG2cbc53bbb [2022-12-06 01:09:20,432 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4a463f7/7c900dfae1044a3689251feb81acffed [2022-12-06 01:09:20,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:09:20,436 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:09:20,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:09:20,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:09:20,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:09:20,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:09:20" (1/1) ... [2022-12-06 01:09:20,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5368e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:20, skipping insertion in model container [2022-12-06 01:09:20,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:09:20" (1/1) ... [2022-12-06 01:09:20,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:09:20,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:09:20,620 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i[949,962] [2022-12-06 01:09:20,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:09:20,864 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:09:20,874 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i[949,962] [2022-12-06 01:09:20,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:09:20,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:09:20,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:09:21,017 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:09:21,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21 WrapperNode [2022-12-06 01:09:21,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:09:21,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:09:21,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:09:21,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:09:21,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,096 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-06 01:09:21,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:09:21,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:09:21,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:09:21,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:09:21,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,148 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:09:21,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:09:21,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:09:21,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:09:21,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (1/1) ... [2022-12-06 01:09:21,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:09:21,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:09:21,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:09:21,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:09:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:09:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:09:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:09:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:09:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:09:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:09:21,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:09:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:09:21,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:09:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:09:21,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:09:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:09:21,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:09:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:09:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:09:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:09:21,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:09:21,235 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:09:21,432 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:09:21,435 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:09:21,740 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:09:21,860 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:09:21,861 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:09:21,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:09:21 BoogieIcfgContainer [2022-12-06 01:09:21,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:09:21,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:09:21,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:09:21,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:09:21,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:09:20" (1/3) ... [2022-12-06 01:09:21,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d044c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:09:21, skipping insertion in model container [2022-12-06 01:09:21,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:09:21" (2/3) ... [2022-12-06 01:09:21,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d044c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:09:21, skipping insertion in model container [2022-12-06 01:09:21,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:09:21" (3/3) ... [2022-12-06 01:09:21,873 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2022-12-06 01:09:21,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:09:21,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:09:21,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:09:21,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:09:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 01:09:22,081 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 01:09:22,081 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:09:22,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 01:09:22,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 01:09:22,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-06 01:09:22,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:22,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 01:09:22,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-06 01:09:22,173 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 01:09:22,173 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:09:22,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 01:09:22,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 01:09:22,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 3044 [2022-12-06 01:09:28,147 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-06 01:09:28,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:09:28,164 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;@16a79886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:09:28,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 01:09:28,167 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 01:09:28,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:09:28,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:28,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 01:09:28,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:28,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash 517776689, now seen corresponding path program 1 times [2022-12-06 01:09:28,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:28,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929709447] [2022-12-06 01:09:28,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:28,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929709447] [2022-12-06 01:09:28,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929709447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:28,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:28,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:09:28,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867338635] [2022-12-06 01:09:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:09:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:09:28,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:09:28,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 01:09:28,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:28,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:28,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 01:09:28,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:29,654 INFO L130 PetriNetUnfolder]: 4863/6830 cut-off events. [2022-12-06 01:09:29,654 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 01:09:29,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 6830 events. 4863/6830 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34804 event pairs, 1800 based on Foata normal form. 0/6221 useless extension candidates. Maximal degree in co-relation 13642. Up to 5308 conditions per place. [2022-12-06 01:09:29,693 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 37 selfloop transitions, 2 changer transitions 8/51 dead transitions. [2022-12-06 01:09:29,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 214 flow [2022-12-06 01:09:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:09:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:09:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 01:09:29,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 01:09:29,706 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2022-12-06 01:09:29,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:29,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 51 transitions, 214 flow [2022-12-06 01:09:29,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 51 transitions, 214 flow [2022-12-06 01:09:29,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 01:09:30,139 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 01:09:30,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 434 [2022-12-06 01:09:30,141 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 210 flow [2022-12-06 01:09:30,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:30,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:30,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:30,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:09:30,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1672548873, now seen corresponding path program 1 times [2022-12-06 01:09:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:30,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958028192] [2022-12-06 01:09:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:30,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958028192] [2022-12-06 01:09:30,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958028192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:30,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:30,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:09:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091757155] [2022-12-06 01:09:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:30,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:09:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:09:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:09:30,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:09:30,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 210 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:30,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:30,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:09:30,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:32,240 INFO L130 PetriNetUnfolder]: 9591/13042 cut-off events. [2022-12-06 01:09:32,241 INFO L131 PetriNetUnfolder]: For 727/727 co-relation queries the response was YES. [2022-12-06 01:09:32,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38147 conditions, 13042 events. 9591/13042 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 64646 event pairs, 744 based on Foata normal form. 0/12086 useless extension candidates. Maximal degree in co-relation 38132. Up to 9747 conditions per place. [2022-12-06 01:09:32,318 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 69 selfloop transitions, 20 changer transitions 25/114 dead transitions. [2022-12-06 01:09:32,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 114 transitions, 704 flow [2022-12-06 01:09:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:09:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:09:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 01:09:32,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6015625 [2022-12-06 01:09:32,322 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-06 01:09:32,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:32,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 114 transitions, 704 flow [2022-12-06 01:09:32,378 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 114 transitions, 704 flow [2022-12-06 01:09:32,378 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:32,384 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:32,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 01:09:32,385 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 114 transitions, 704 flow [2022-12-06 01:09:32,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:32,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:32,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:32,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:09:32,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash -309407726, now seen corresponding path program 1 times [2022-12-06 01:09:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:32,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764971910] [2022-12-06 01:09:32,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:32,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:33,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764971910] [2022-12-06 01:09:33,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764971910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:33,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:33,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:09:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099824398] [2022-12-06 01:09:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:33,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:09:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:09:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:09:33,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:09:33,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 114 transitions, 704 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:33,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:33,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:09:33,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:34,852 INFO L130 PetriNetUnfolder]: 9511/12950 cut-off events. [2022-12-06 01:09:34,852 INFO L131 PetriNetUnfolder]: For 710/710 co-relation queries the response was YES. [2022-12-06 01:09:34,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50834 conditions, 12950 events. 9511/12950 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 63902 event pairs, 622 based on Foata normal form. 0/12022 useless extension candidates. Maximal degree in co-relation 50816. Up to 9760 conditions per place. [2022-12-06 01:09:34,914 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 120 selfloop transitions, 35 changer transitions 59/214 dead transitions. [2022-12-06 01:09:34,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 214 transitions, 1744 flow [2022-12-06 01:09:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:09:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:09:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 01:09:34,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.640625 [2022-12-06 01:09:34,921 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2022-12-06 01:09:34,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:34,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 214 transitions, 1744 flow [2022-12-06 01:09:34,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 214 transitions, 1744 flow [2022-12-06 01:09:34,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:34,978 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:34,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-06 01:09:34,979 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 214 transitions, 1744 flow [2022-12-06 01:09:34,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:34,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:34,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:09:34,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:34,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:34,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1365833866, now seen corresponding path program 1 times [2022-12-06 01:09:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:34,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381003507] [2022-12-06 01:09:34,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:35,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381003507] [2022-12-06 01:09:35,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381003507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:35,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:35,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:09:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905357426] [2022-12-06 01:09:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:35,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:09:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:35,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:09:35,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:09:35,491 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:09:35,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 214 transitions, 1744 flow. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:35,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:35,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:09:35,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:37,503 INFO L130 PetriNetUnfolder]: 10891/14846 cut-off events. [2022-12-06 01:09:37,503 INFO L131 PetriNetUnfolder]: For 871/871 co-relation queries the response was YES. [2022-12-06 01:09:37,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73129 conditions, 14846 events. 10891/14846 cut-off events. For 871/871 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 75192 event pairs, 594 based on Foata normal form. 0/13852 useless extension candidates. Maximal degree in co-relation 73108. Up to 11426 conditions per place. [2022-12-06 01:09:37,581 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 150 selfloop transitions, 60 changer transitions 77/287 dead transitions. [2022-12-06 01:09:37,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 287 transitions, 2867 flow [2022-12-06 01:09:37,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:09:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:09:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-12-06 01:09:37,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2022-12-06 01:09:37,586 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2022-12-06 01:09:37,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:37,587 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 287 transitions, 2867 flow [2022-12-06 01:09:37,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 287 transitions, 2867 flow [2022-12-06 01:09:37,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:37,659 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:37,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 01:09:37,666 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 287 transitions, 2867 flow [2022-12-06 01:09:37,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:37,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:37,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:37,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:09:37,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1364968966, now seen corresponding path program 2 times [2022-12-06 01:09:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:37,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482483537] [2022-12-06 01:09:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:38,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482483537] [2022-12-06 01:09:38,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482483537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:38,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:38,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:09:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802346908] [2022-12-06 01:09:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:09:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:38,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:09:38,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:09:38,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:09:38,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 287 transitions, 2867 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:38,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:38,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:09:38,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:40,163 INFO L130 PetriNetUnfolder]: 12204/16631 cut-off events. [2022-12-06 01:09:40,163 INFO L131 PetriNetUnfolder]: For 906/906 co-relation queries the response was YES. [2022-12-06 01:09:40,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98560 conditions, 16631 events. 12204/16631 cut-off events. For 906/906 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 85480 event pairs, 572 based on Foata normal form. 0/15577 useless extension candidates. Maximal degree in co-relation 98536. Up to 12834 conditions per place. [2022-12-06 01:09:40,258 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 199 selfloop transitions, 83 changer transitions 97/379 dead transitions. [2022-12-06 01:09:40,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 379 transitions, 4530 flow [2022-12-06 01:09:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:09:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:09:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-06 01:09:40,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.578125 [2022-12-06 01:09:40,263 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-06 01:09:40,264 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:40,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 379 transitions, 4530 flow [2022-12-06 01:09:40,355 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 379 transitions, 4530 flow [2022-12-06 01:09:40,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:40,363 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:40,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 01:09:40,365 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 379 transitions, 4530 flow [2022-12-06 01:09:40,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:40,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:40,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:40,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:09:40,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1013425403, now seen corresponding path program 1 times [2022-12-06 01:09:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:40,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478228345] [2022-12-06 01:09:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:40,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:40,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478228345] [2022-12-06 01:09:40,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478228345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:40,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:40,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:09:40,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491373892] [2022-12-06 01:09:40,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:40,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:09:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:40,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:09:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:09:40,782 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:09:40,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 379 transitions, 4530 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:40,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:40,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:09:40,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:43,515 INFO L130 PetriNetUnfolder]: 16262/22327 cut-off events. [2022-12-06 01:09:43,516 INFO L131 PetriNetUnfolder]: For 1163/1163 co-relation queries the response was YES. [2022-12-06 01:09:43,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154712 conditions, 22327 events. 16262/22327 cut-off events. For 1163/1163 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 122744 event pairs, 382 based on Foata normal form. 0/21063 useless extension candidates. Maximal degree in co-relation 154685. Up to 17895 conditions per place. [2022-12-06 01:09:43,628 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 271 selfloop transitions, 36 changer transitions 222/529 dead transitions. [2022-12-06 01:09:43,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 529 transitions, 7362 flow [2022-12-06 01:09:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:09:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:09:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-06 01:09:43,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.640625 [2022-12-06 01:09:43,630 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-06 01:09:43,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:43,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 529 transitions, 7362 flow [2022-12-06 01:09:43,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 529 transitions, 7362 flow [2022-12-06 01:09:43,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:43,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:43,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-06 01:09:43,773 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 529 transitions, 7362 flow [2022-12-06 01:09:43,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:43,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:43,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:09:43,773 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1013454326, now seen corresponding path program 1 times [2022-12-06 01:09:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538343821] [2022-12-06 01:09:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:43,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538343821] [2022-12-06 01:09:43,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538343821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:43,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:43,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:09:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491202272] [2022-12-06 01:09:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:43,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:09:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:43,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:09:43,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:09:43,937 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 01:09:43,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 529 transitions, 7362 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:43,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:43,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 01:09:43,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:46,713 INFO L130 PetriNetUnfolder]: 13090/18556 cut-off events. [2022-12-06 01:09:46,713 INFO L131 PetriNetUnfolder]: For 2629/2629 co-relation queries the response was YES. [2022-12-06 01:09:46,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145666 conditions, 18556 events. 13090/18556 cut-off events. For 2629/2629 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 106957 event pairs, 309 based on Foata normal form. 854/18227 useless extension candidates. Maximal degree in co-relation 145636. Up to 15407 conditions per place. [2022-12-06 01:09:46,792 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 321 selfloop transitions, 33 changer transitions 564/939 dead transitions. [2022-12-06 01:09:46,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 939 transitions, 14949 flow [2022-12-06 01:09:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:09:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:09:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 01:09:46,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.60625 [2022-12-06 01:09:46,795 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2022-12-06 01:09:46,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:46,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 939 transitions, 14949 flow [2022-12-06 01:09:46,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 939 transitions, 14949 flow [2022-12-06 01:09:46,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:46,954 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:46,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-06 01:09:46,955 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 939 transitions, 14949 flow [2022-12-06 01:09:46,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:46,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:46,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:46,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:09:46,956 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1808241063, now seen corresponding path program 1 times [2022-12-06 01:09:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:46,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095502959] [2022-12-06 01:09:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:46,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:47,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095502959] [2022-12-06 01:09:47,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095502959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:47,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:47,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:09:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740646735] [2022-12-06 01:09:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:47,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:09:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:09:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:09:47,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 01:09:47,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 939 transitions, 14949 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:47,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:47,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 01:09:47,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:49,668 INFO L130 PetriNetUnfolder]: 9842/14182 cut-off events. [2022-12-06 01:09:49,669 INFO L131 PetriNetUnfolder]: For 3947/3947 co-relation queries the response was YES. [2022-12-06 01:09:49,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124433 conditions, 14182 events. 9842/14182 cut-off events. For 3947/3947 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 80368 event pairs, 117 based on Foata normal form. 569/13697 useless extension candidates. Maximal degree in co-relation 124400. Up to 12072 conditions per place. [2022-12-06 01:09:49,729 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 335 selfloop transitions, 62 changer transitions 944/1358 dead transitions. [2022-12-06 01:09:49,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 1358 transitions, 24318 flow [2022-12-06 01:09:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:09:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:09:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-12-06 01:09:49,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6205357142857143 [2022-12-06 01:09:49,731 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2022-12-06 01:09:49,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:49,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 1358 transitions, 24318 flow [2022-12-06 01:09:49,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 1358 transitions, 24318 flow [2022-12-06 01:09:49,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:49,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:49,849 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 01:09:49,849 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 1358 transitions, 24318 flow [2022-12-06 01:09:49,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:49,849 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:49,849 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:49,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:09:49,849 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1967844081, now seen corresponding path program 1 times [2022-12-06 01:09:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998587768] [2022-12-06 01:09:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:50,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:50,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998587768] [2022-12-06 01:09:50,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998587768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:50,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:50,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:09:50,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653185437] [2022-12-06 01:09:50,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:50,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:09:50,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:09:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:09:50,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 01:09:50,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 1358 transitions, 24318 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-06 01:09:50,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:50,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 01:09:50,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:52,836 INFO L130 PetriNetUnfolder]: 8940/12790 cut-off events. [2022-12-06 01:09:52,836 INFO L131 PetriNetUnfolder]: For 6629/6629 co-relation queries the response was YES. [2022-12-06 01:09:52,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123956 conditions, 12790 events. 8940/12790 cut-off events. For 6629/6629 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 70626 event pairs, 30 based on Foata normal form. 204/12000 useless extension candidates. Maximal degree in co-relation 123920. Up to 11036 conditions per place. [2022-12-06 01:09:52,905 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 305 selfloop transitions, 81 changer transitions 1129/1528 dead transitions. [2022-12-06 01:09:52,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 1528 transitions, 30441 flow [2022-12-06 01:09:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:09:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:09:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2022-12-06 01:09:52,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-06 01:09:52,908 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2022-12-06 01:09:52,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:52,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 1528 transitions, 30441 flow [2022-12-06 01:09:53,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 1528 transitions, 30441 flow [2022-12-06 01:09:53,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:53,056 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:53,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 01:09:53,057 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 1528 transitions, 30441 flow [2022-12-06 01:09:53,058 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-06 01:09:53,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:53,058 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:53,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:09:53,058 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2005693249, now seen corresponding path program 1 times [2022-12-06 01:09:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:53,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204498052] [2022-12-06 01:09:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:53,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:53,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204498052] [2022-12-06 01:09:53,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204498052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:53,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:53,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:09:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284477128] [2022-12-06 01:09:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:53,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:09:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:53,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:09:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:09:53,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:09:53,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 1528 transitions, 30441 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:53,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:53,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:09:53,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:09:57,464 INFO L130 PetriNetUnfolder]: 12850/18533 cut-off events. [2022-12-06 01:09:57,465 INFO L131 PetriNetUnfolder]: For 8650/8650 co-relation queries the response was YES. [2022-12-06 01:09:57,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199180 conditions, 18533 events. 12850/18533 cut-off events. For 8650/8650 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 110569 event pairs, 14 based on Foata normal form. 0/17110 useless extension candidates. Maximal degree in co-relation 199141. Up to 16168 conditions per place. [2022-12-06 01:09:57,553 INFO L137 encePairwiseOnDemand]: 16/32 looper letters, 313 selfloop transitions, 45 changer transitions 2745/3103 dead transitions. [2022-12-06 01:09:57,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 3103 transitions, 67988 flow [2022-12-06 01:09:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:09:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:09:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-12-06 01:09:57,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-06 01:09:57,556 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2022-12-06 01:09:57,557 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:09:57,557 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 3103 transitions, 67988 flow [2022-12-06 01:09:57,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 3103 transitions, 67988 flow [2022-12-06 01:09:57,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:09:57,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:09:57,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 01:09:57,779 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 3103 transitions, 67988 flow [2022-12-06 01:09:57,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:09:57,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:09:57,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:09:57,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:09:57,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:09:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:09:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1533950341, now seen corresponding path program 1 times [2022-12-06 01:09:57,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:09:57,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660265042] [2022-12-06 01:09:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:09:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:09:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:09:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:09:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:09:58,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660265042] [2022-12-06 01:09:58,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660265042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:09:58,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:09:58,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:09:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725713363] [2022-12-06 01:09:58,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:09:58,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:09:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:09:58,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:09:58,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:09:58,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 01:09:58,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 3103 transitions, 67988 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-06 01:09:58,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:09:58,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 01:09:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:04,650 INFO L130 PetriNetUnfolder]: 12726/18263 cut-off events. [2022-12-06 01:10:04,651 INFO L131 PetriNetUnfolder]: For 13531/13531 co-relation queries the response was YES. [2022-12-06 01:10:04,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213284 conditions, 18263 events. 12726/18263 cut-off events. For 13531/13531 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 108437 event pairs, 6 based on Foata normal form. 61/16913 useless extension candidates. Maximal degree in co-relation 213242. Up to 15983 conditions per place. [2022-12-06 01:10:04,740 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 175 selfloop transitions, 68 changer transitions 2827/3077 dead transitions. [2022-12-06 01:10:04,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 3077 transitions, 73484 flow [2022-12-06 01:10:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:10:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:10:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2022-12-06 01:10:04,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2022-12-06 01:10:04,742 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 50 predicate places. [2022-12-06 01:10:04,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:04,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 3077 transitions, 73484 flow [2022-12-06 01:10:04,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 3077 transitions, 73484 flow [2022-12-06 01:10:04,959 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:04,971 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:04,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 01:10:04,973 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 3077 transitions, 73484 flow [2022-12-06 01:10:04,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-06 01:10:04,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:04,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:04,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:10:04,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:10:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:04,974 INFO L85 PathProgramCache]: Analyzing trace with hash 151920274, now seen corresponding path program 1 times [2022-12-06 01:10:04,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:04,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173651526] [2022-12-06 01:10:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:04,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:10:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:06,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173651526] [2022-12-06 01:10:06,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173651526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:06,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:06,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:10:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987805747] [2022-12-06 01:10:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:06,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:10:06,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:06,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:10:06,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:10:06,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:10:06,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 3077 transitions, 73484 flow. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:06,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:06,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:10:06,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:14,538 INFO L130 PetriNetUnfolder]: 16381/23811 cut-off events. [2022-12-06 01:10:14,538 INFO L131 PetriNetUnfolder]: For 13183/13183 co-relation queries the response was YES. [2022-12-06 01:10:14,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301819 conditions, 23811 events. 16381/23811 cut-off events. For 13183/13183 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 151491 event pairs, 3 based on Foata normal form. 0/21953 useless extension candidates. Maximal degree in co-relation 301774. Up to 20823 conditions per place. [2022-12-06 01:10:14,649 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 212 selfloop transitions, 54 changer transitions 3635/3901 dead transitions. [2022-12-06 01:10:14,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 3901 transitions, 101037 flow [2022-12-06 01:10:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:10:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:10:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 01:10:14,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2022-12-06 01:10:14,652 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 56 predicate places. [2022-12-06 01:10:14,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:14,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 3901 transitions, 101037 flow [2022-12-06 01:10:14,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 3901 transitions, 101037 flow [2022-12-06 01:10:14,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:14,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:14,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-06 01:10:14,953 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 3901 transitions, 101037 flow [2022-12-06 01:10:14,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:14,953 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:14,953 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:14,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:10:14,953 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:10:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1038766724, now seen corresponding path program 2 times [2022-12-06 01:10:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:14,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076258130] [2022-12-06 01:10:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:16,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:10:16,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:16,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076258130] [2022-12-06 01:10:16,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076258130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:16,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:16,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:10:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794156359] [2022-12-06 01:10:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:16,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:10:16,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:10:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:10:16,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:10:16,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 3901 transitions, 101037 flow. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:16,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:16,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:10:16,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:10:32,634 INFO L130 PetriNetUnfolder]: 22845/33868 cut-off events. [2022-12-06 01:10:32,634 INFO L131 PetriNetUnfolder]: For 14374/14374 co-relation queries the response was YES. [2022-12-06 01:10:32,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464341 conditions, 33868 events. 22845/33868 cut-off events. For 14374/14374 co-relation queries the response was YES. Maximal size of possible extension queue 2039. Compared 235939 event pairs, 6 based on Foata normal form. 0/31193 useless extension candidates. Maximal degree in co-relation 464293. Up to 30476 conditions per place. [2022-12-06 01:10:32,737 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 316 selfloop transitions, 99 changer transitions 6359/6774 dead transitions. [2022-12-06 01:10:32,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 6774 transitions, 189104 flow [2022-12-06 01:10:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 01:10:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 01:10:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2022-12-06 01:10:32,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.50625 [2022-12-06 01:10:32,739 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places. [2022-12-06 01:10:32,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:10:32,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 6774 transitions, 189104 flow [2022-12-06 01:10:33,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 6774 transitions, 189104 flow [2022-12-06 01:10:33,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:10:33,030 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:10:33,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 01:10:33,031 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 6774 transitions, 189104 flow [2022-12-06 01:10:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:33,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:10:33,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:10:33,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:10:33,032 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:10:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:10:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1067863726, now seen corresponding path program 3 times [2022-12-06 01:10:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:10:33,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382431419] [2022-12-06 01:10:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:10:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:10:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:10:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:10:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:10:34,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382431419] [2022-12-06 01:10:34,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382431419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:10:34,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:10:34,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:10:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197004535] [2022-12-06 01:10:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:10:34,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:10:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:10:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:10:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:10:34,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 01:10:34,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 6774 transitions, 189104 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:10:34,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:10:34,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 01:10:34,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:05,688 INFO L130 PetriNetUnfolder]: 25669/38334 cut-off events. [2022-12-06 01:11:05,688 INFO L131 PetriNetUnfolder]: For 16580/16580 co-relation queries the response was YES. [2022-12-06 01:11:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564324 conditions, 38334 events. 25669/38334 cut-off events. For 16580/16580 co-relation queries the response was YES. Maximal size of possible extension queue 2390. Compared 275879 event pairs, 8 based on Foata normal form. 0/35287 useless extension candidates. Maximal degree in co-relation 564273. Up to 34936 conditions per place. [2022-12-06 01:11:05,814 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 352 selfloop transitions, 88 changer transitions 7500/7940 dead transitions. [2022-12-06 01:11:05,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 7940 transitions, 237599 flow [2022-12-06 01:11:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:11:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:11:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-06 01:11:05,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2022-12-06 01:11:05,817 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 71 predicate places. [2022-12-06 01:11:05,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:05,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 7940 transitions, 237599 flow [2022-12-06 01:11:06,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 7940 transitions, 237599 flow [2022-12-06 01:11:06,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:06,173 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:06,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 357 [2022-12-06 01:11:06,174 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 7940 transitions, 237599 flow [2022-12-06 01:11:06,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:06,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:06,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:06,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:11:06,174 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:11:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1438199228, now seen corresponding path program 4 times [2022-12-06 01:11:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:06,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581896877] [2022-12-06 01:11:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:07,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581896877] [2022-12-06 01:11:07,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581896877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:07,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:07,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:11:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173488554] [2022-12-06 01:11:07,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:07,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:11:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:07,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:11:07,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:11:07,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 01:11:07,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 7940 transitions, 237599 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:07,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:07,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 01:11:07,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:11:49,903 INFO L130 PetriNetUnfolder]: 26631/40114 cut-off events. [2022-12-06 01:11:49,903 INFO L131 PetriNetUnfolder]: For 22215/22215 co-relation queries the response was YES. [2022-12-06 01:11:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628904 conditions, 40114 events. 26631/40114 cut-off events. For 22215/22215 co-relation queries the response was YES. Maximal size of possible extension queue 2458. Compared 295371 event pairs, 5 based on Foata normal form. 0/36907 useless extension candidates. Maximal degree in co-relation 628850. Up to 36706 conditions per place. [2022-12-06 01:11:50,047 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 297 selfloop transitions, 49 changer transitions 8407/8760 dead transitions. [2022-12-06 01:11:50,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 8760 transitions, 279534 flow [2022-12-06 01:11:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:11:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:11:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 01:11:50,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 01:11:50,049 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 75 predicate places. [2022-12-06 01:11:50,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:11:50,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 8760 transitions, 279534 flow [2022-12-06 01:11:50,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 8760 transitions, 279534 flow [2022-12-06 01:11:50,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:11:50,602 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:11:50,603 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 554 [2022-12-06 01:11:50,603 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 8760 transitions, 279534 flow [2022-12-06 01:11:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:50,603 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:11:50,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:11:50,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:11:50,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:11:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:11:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash -924274692, now seen corresponding path program 5 times [2022-12-06 01:11:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:11:50,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681013324] [2022-12-06 01:11:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:11:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:11:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:11:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:11:50,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:11:50,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681013324] [2022-12-06 01:11:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681013324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:11:50,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:11:50,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:11:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903207965] [2022-12-06 01:11:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:11:50,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:11:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:11:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:11:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:11:50,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 01:11:50,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 8760 transitions, 279534 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:11:50,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:11:50,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 01:11:50,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:12:59,289 INFO L130 PetriNetUnfolder]: 33812/51686 cut-off events. [2022-12-06 01:12:59,289 INFO L131 PetriNetUnfolder]: For 63979/63979 co-relation queries the response was YES. [2022-12-06 01:12:59,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862190 conditions, 51686 events. 33812/51686 cut-off events. For 63979/63979 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 406088 event pairs, 8 based on Foata normal form. 0/47515 useless extension candidates. Maximal degree in co-relation 862133. Up to 47471 conditions per place. [2022-12-06 01:12:59,489 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 0 selfloop transitions, 0 changer transitions 13013/13013 dead transitions. [2022-12-06 01:12:59,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 13013 transitions, 441594 flow [2022-12-06 01:12:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:12:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:12:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 01:12:59,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-06 01:12:59,491 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 77 predicate places. [2022-12-06 01:12:59,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:12:59,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 13013 transitions, 441594 flow [2022-12-06 01:13:00,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 13013 transitions, 441594 flow [2022-12-06 01:13:00,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:13:00,097 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:13:00,098 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 607 [2022-12-06 01:13:00,098 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 13013 transitions, 441594 flow [2022-12-06 01:13:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:13:00,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 01:13:00,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 01:13:00,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 01:13:00,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 01:13:00,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 01:13:00,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 01:13:00,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 01:13:00,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 01:13:00,102 INFO L458 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:13:00,106 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:13:00,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:13:00,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:13:00 BasicIcfg [2022-12-06 01:13:00,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:13:00,109 INFO L158 Benchmark]: Toolchain (without parser) took 219673.36ms. Allocated memory was 212.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 170.9MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 01:13:00,110 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory is still 189.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:13:00,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.38ms. Allocated memory is still 212.9MB. Free memory was 170.4MB in the beginning and 142.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 01:13:00,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.10ms. Allocated memory is still 212.9MB. Free memory was 142.6MB in the beginning and 140.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:13:00,110 INFO L158 Benchmark]: Boogie Preprocessor took 55.18ms. Allocated memory is still 212.9MB. Free memory was 140.0MB in the beginning and 137.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:13:00,111 INFO L158 Benchmark]: RCFGBuilder took 709.72ms. Allocated memory is still 212.9MB. Free memory was 137.9MB in the beginning and 99.1MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 01:13:00,111 INFO L158 Benchmark]: TraceAbstraction took 218244.41ms. Allocated memory was 212.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 98.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 01:13:00,112 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory is still 189.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 578.38ms. Allocated memory is still 212.9MB. Free memory was 170.4MB in the beginning and 142.6MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.10ms. Allocated memory is still 212.9MB. Free memory was 142.6MB in the beginning and 140.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.18ms. Allocated memory is still 212.9MB. Free memory was 140.0MB in the beginning and 137.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 709.72ms. Allocated memory is still 212.9MB. Free memory was 137.9MB in the beginning and 99.1MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 218244.41ms. Allocated memory was 212.9MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 98.1MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 135 PlacesBefore, 46 PlacesAfterwards, 124 TransitionsBefore, 34 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 2249, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1883, independent: 1836, independent conditional: 0, independent unconditional: 1836, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1883, independent: 1790, independent conditional: 0, independent unconditional: 1790, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 347, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 281, dependent conditional: 0, dependent unconditional: 281, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2318, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1883, unknown conditional: 0, unknown unconditional: 1883] , Statistics on independence cache: Total cache size (in pairs): 2884, Positive cache size: 2837, Positive conditional cache size: 0, Positive unconditional cache size: 2837, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, 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.4s, 46 PlacesBefore, 44 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 114 TransitionsBefore, 114 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 214 TransitionsBefore, 214 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 287 TransitionsBefore, 287 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 379 TransitionsBefore, 379 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 529 TransitionsBefore, 529 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 939 TransitionsBefore, 939 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 1358 TransitionsBefore, 1358 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 1528 TransitionsBefore, 1528 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 3103 TransitionsBefore, 3103 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 3077 TransitionsBefore, 3077 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 3901 TransitionsBefore, 3901 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 6774 TransitionsBefore, 6774 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 7940 TransitionsBefore, 7940 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 121 PlacesBefore, 121 PlacesAfterwards, 8760 TransitionsBefore, 8760 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 13013 TransitionsBefore, 13013 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 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: 218.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 198.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1194 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2661 IncrementalHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 40 mSDtfsCounter, 2661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=441594occurred in iteration=16, InterpolantAutomatonStates: 98, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 3270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 01:13:00,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...