/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:02:35,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:02:35,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:02:35,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:02:35,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:02:35,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:02:35,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:02:35,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:02:35,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:02:35,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:02:35,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:02:35,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:02:35,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:02:35,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:02:35,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:02:35,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:02:35,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:02:35,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:02:35,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:02:35,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:02:35,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:02:35,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:02:35,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:02:35,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:02:35,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:02:35,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:02:35,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:02:35,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:02:35,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:02:35,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:02:35,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:02:35,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:02:35,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:02:35,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:02:35,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:02:35,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:02:35,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:02:35,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:02:35,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:02:35,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:02:35,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:02:35,723 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:02:35,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:02:35,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:02:35,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:02:35,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:02:35,756 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:02:35,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:02:35,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:02:35,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:02:35,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:02:35,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:02:35,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:02:35,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:02:35,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:02:35,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:02:35,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:02:35,760 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:02:36,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:02:36,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:02:36,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:02:36,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:02:36,069 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:02:36,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-06 01:02:37,180 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:02:37,461 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:02:37,462 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-06 01:02:37,478 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceadc4eb4/4e1f38e88d334369a71e56e318564ffd/FLAGfd17576e7 [2022-12-06 01:02:37,493 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceadc4eb4/4e1f38e88d334369a71e56e318564ffd [2022-12-06 01:02:37,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:02:37,497 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:02:37,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:02:37,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:02:37,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:02:37,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:37,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196fd035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37, skipping insertion in model container [2022-12-06 01:02:37,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:37,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:02:37,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:02:37,715 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/mix021_tso.oepc.i[949,962] [2022-12-06 01:02:37,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:02:37,917 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:02:37,925 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/mix021_tso.oepc.i[949,962] [2022-12-06 01:02:37,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:02:37,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:02:37,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:02:37,994 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:02:37,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37 WrapperNode [2022-12-06 01:02:37,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:02:37,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:02:37,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:02:37,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:02:38,002 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:02:37" (1/1) ... [2022-12-06 01:02:38,015 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:02:37" (1/1) ... [2022-12-06 01:02:38,037 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-06 01:02:38,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:02:38,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:02:38,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:02:38,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:02:38,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,068 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:02:38,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:02:38,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:02:38,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:02:38,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (1/1) ... [2022-12-06 01:02:38,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:02:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:02:38,112 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:02:38,121 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:02:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:02:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:02:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:02:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:02:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:02:38,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:02:38,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:02:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:02:38,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:02:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:02:38,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:02:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:02:38,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:02:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:02:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:02:38,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:02:38,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:02:38,143 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:02:38,289 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:02:38,290 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:02:38,555 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:02:38,651 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:02:38,651 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:02:38,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:02:38 BoogieIcfgContainer [2022-12-06 01:02:38,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:02:38,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:02:38,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:02:38,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:02:38,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:02:37" (1/3) ... [2022-12-06 01:02:38,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4632a9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:02:38, skipping insertion in model container [2022-12-06 01:02:38,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:02:37" (2/3) ... [2022-12-06 01:02:38,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4632a9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:02:38, skipping insertion in model container [2022-12-06 01:02:38,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:02:38" (3/3) ... [2022-12-06 01:02:38,659 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-12-06 01:02:38,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:02:38,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:02:38,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:02:38,724 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:02:38,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 01:02:38,816 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 01:02:38,816 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:02:38,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 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/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 01:02:38,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 01:02:38,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 01:02:38,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:38,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 01:02:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 01:02:38,918 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 01:02:38,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:02:38,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 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/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 01:02:38,928 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 01:02:38,928 INFO L188 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-06 01:02:44,227 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 01:02:44,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:02:44,242 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;@19f7b052, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:02:44,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 01:02:44,245 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 01:02:44,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:02:44,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:44,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:44,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash -375403712, now seen corresponding path program 1 times [2022-12-06 01:02:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:44,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211138914] [2022-12-06 01:02:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:44,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211138914] [2022-12-06 01:02:44,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211138914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:44,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:44,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:02:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194243387] [2022-12-06 01:02:44,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:44,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:02:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:44,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:02:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:02:44,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-06 01:02:44,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:44,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:44,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-06 01:02:44,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:45,145 INFO L130 PetriNetUnfolder]: 3519/5103 cut-off events. [2022-12-06 01:02:45,145 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 01:02:45,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 5103 events. 3519/5103 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27245 event pairs, 954 based on Foata normal form. 0/4619 useless extension candidates. Maximal degree in co-relation 10071. Up to 3826 conditions per place. [2022-12-06 01:02:45,171 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2022-12-06 01:02:45,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2022-12-06 01:02:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:02:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:02:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 01:02:45,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2022-12-06 01:02:45,183 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2022-12-06 01:02:45,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:45,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 46 transitions, 189 flow [2022-12-06 01:02:45,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 46 transitions, 189 flow [2022-12-06 01:02:45,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 01:02:45,406 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 01:02:45,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 01:02:45,408 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 185 flow [2022-12-06 01:02:45,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:45,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:45,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:45,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:02:45,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 879830714, now seen corresponding path program 1 times [2022-12-06 01:02:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:45,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598400380] [2022-12-06 01:02:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:45,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:45,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:45,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:45,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598400380] [2022-12-06 01:02:45,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598400380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:45,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:45,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:02:45,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248724007] [2022-12-06 01:02:45,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:45,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:02:45,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:45,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:02:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:02:45,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 01:02:45,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:02:45,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:45,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 01:02:45,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:46,518 INFO L130 PetriNetUnfolder]: 7066/9695 cut-off events. [2022-12-06 01:02:46,519 INFO L131 PetriNetUnfolder]: For 326/326 co-relation queries the response was YES. [2022-12-06 01:02:46,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27981 conditions, 9695 events. 7066/9695 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 50185 event pairs, 1057 based on Foata normal form. 0/8899 useless extension candidates. Maximal degree in co-relation 27966. Up to 9022 conditions per place. [2022-12-06 01:02:46,559 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 59 selfloop transitions, 5 changer transitions 12/77 dead transitions. [2022-12-06 01:02:46,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 477 flow [2022-12-06 01:02:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:02:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:02:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 01:02:46,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2022-12-06 01:02:46,563 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2022-12-06 01:02:46,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:46,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 77 transitions, 477 flow [2022-12-06 01:02:46,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 77 transitions, 477 flow [2022-12-06 01:02:46,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 01:02:46,606 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:46,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 01:02:46,608 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 77 transitions, 477 flow [2022-12-06 01:02:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:02:46,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:46,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:02:46,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1504948492, now seen corresponding path program 1 times [2022-12-06 01:02:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022590507] [2022-12-06 01:02:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:46,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:46,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022590507] [2022-12-06 01:02:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022590507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:46,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:46,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:02:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380706750] [2022-12-06 01:02:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:46,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:02:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:02:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:02:46,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 01:02:46,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 77 transitions, 477 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:02:46,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:46,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 01:02:46,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:48,153 INFO L130 PetriNetUnfolder]: 8987/12308 cut-off events. [2022-12-06 01:02:48,153 INFO L131 PetriNetUnfolder]: For 1161/1161 co-relation queries the response was YES. [2022-12-06 01:02:48,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47026 conditions, 12308 events. 8987/12308 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 61718 event pairs, 397 based on Foata normal form. 0/11492 useless extension candidates. Maximal degree in co-relation 47008. Up to 11046 conditions per place. [2022-12-06 01:02:48,199 INFO L137 encePairwiseOnDemand]: 17/31 looper letters, 97 selfloop transitions, 19 changer transitions 39/155 dead transitions. [2022-12-06 01:02:48,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 155 transitions, 1239 flow [2022-12-06 01:02:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:02:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:02:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 01:02:48,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2022-12-06 01:02:48,202 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2022-12-06 01:02:48,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:48,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 155 transitions, 1239 flow [2022-12-06 01:02:48,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 155 transitions, 1239 flow [2022-12-06 01:02:48,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:48,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:48,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 01:02:48,257 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 155 transitions, 1239 flow [2022-12-06 01:02:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:02:48,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:48,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:48,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:02:48,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1148457811, now seen corresponding path program 1 times [2022-12-06 01:02:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:48,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551404740] [2022-12-06 01:02:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:48,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:48,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:48,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551404740] [2022-12-06 01:02:48,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551404740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:48,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:48,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610983128] [2022-12-06 01:02:48,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:48,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:02:48,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:02:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:02:48,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 01:02:48,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 155 transitions, 1239 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:02:48,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:48,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 01:02:48,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:50,143 INFO L130 PetriNetUnfolder]: 9450/12923 cut-off events. [2022-12-06 01:02:50,144 INFO L131 PetriNetUnfolder]: For 1755/1755 co-relation queries the response was YES. [2022-12-06 01:02:50,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61516 conditions, 12923 events. 9450/12923 cut-off events. For 1755/1755 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 64844 event pairs, 581 based on Foata normal form. 0/12101 useless extension candidates. Maximal degree in co-relation 61495. Up to 11515 conditions per place. [2022-12-06 01:02:50,199 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 154 selfloop transitions, 30 changer transitions 59/247 dead transitions. [2022-12-06 01:02:50,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 247 transitions, 2437 flow [2022-12-06 01:02:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:02:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:02:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 01:02:50,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2022-12-06 01:02:50,202 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2022-12-06 01:02:50,203 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:50,203 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 247 transitions, 2437 flow [2022-12-06 01:02:50,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 247 transitions, 2437 flow [2022-12-06 01:02:50,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:50,270 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:50,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 01:02:50,277 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 247 transitions, 2437 flow [2022-12-06 01:02:50,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:02:50,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:50,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:50,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:02:50,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1162758421, now seen corresponding path program 2 times [2022-12-06 01:02:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:50,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003581388] [2022-12-06 01:02:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:50,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:50,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003581388] [2022-12-06 01:02:50,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003581388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:50,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:50,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413345636] [2022-12-06 01:02:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:50,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:02:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:02:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:02:50,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 01:02:50,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 247 transitions, 2437 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:02:50,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:50,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 01:02:50,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:51,883 INFO L130 PetriNetUnfolder]: 9511/13008 cut-off events. [2022-12-06 01:02:51,883 INFO L131 PetriNetUnfolder]: For 2538/2538 co-relation queries the response was YES. [2022-12-06 01:02:51,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74192 conditions, 13008 events. 9511/13008 cut-off events. For 2538/2538 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 64999 event pairs, 784 based on Foata normal form. 0/12192 useless extension candidates. Maximal degree in co-relation 74168. Up to 11574 conditions per place. [2022-12-06 01:02:51,938 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 223 selfloop transitions, 65 changer transitions 83/375 dead transitions. [2022-12-06 01:02:51,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 375 transitions, 4399 flow [2022-12-06 01:02:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:02:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:02:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-06 01:02:51,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5096774193548387 [2022-12-06 01:02:51,940 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2022-12-06 01:02:51,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:51,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 375 transitions, 4399 flow [2022-12-06 01:02:51,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 375 transitions, 4399 flow [2022-12-06 01:02:51,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:52,002 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:52,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 01:02:52,003 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 375 transitions, 4399 flow [2022-12-06 01:02:52,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:02:52,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:52,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:52,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:02:52,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:52,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1148069567, now seen corresponding path program 1 times [2022-12-06 01:02:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:52,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336527090] [2022-12-06 01:02:52,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336527090] [2022-12-06 01:02:52,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336527090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:52,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:52,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:02:52,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809896645] [2022-12-06 01:02:52,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:52,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:02:52,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:02:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:02:52,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 01:02:52,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 375 transitions, 4399 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:02:52,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:52,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 01:02:52,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:54,302 INFO L130 PetriNetUnfolder]: 11411/15604 cut-off events. [2022-12-06 01:02:54,302 INFO L131 PetriNetUnfolder]: For 5125/5125 co-relation queries the response was YES. [2022-12-06 01:02:54,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104017 conditions, 15604 events. 11411/15604 cut-off events. For 5125/5125 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 81219 event pairs, 318 based on Foata normal form. 0/14708 useless extension candidates. Maximal degree in co-relation 103990. Up to 14170 conditions per place. [2022-12-06 01:02:54,393 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 279 selfloop transitions, 101 changer transitions 107/491 dead transitions. [2022-12-06 01:02:54,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 491 transitions, 6760 flow [2022-12-06 01:02:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 01:02:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 01:02:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2022-12-06 01:02:54,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4798387096774194 [2022-12-06 01:02:54,398 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2022-12-06 01:02:54,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:54,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 491 transitions, 6760 flow [2022-12-06 01:02:54,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 491 transitions, 6760 flow [2022-12-06 01:02:54,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:54,600 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:54,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 01:02:54,601 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 491 transitions, 6760 flow [2022-12-06 01:02:54,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:02:54,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:54,601 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:54,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:02:54,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1785482561, now seen corresponding path program 1 times [2022-12-06 01:02:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:54,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828647918] [2022-12-06 01:02:54,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:54,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828647918] [2022-12-06 01:02:54,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828647918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:54,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:54,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:02:54,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113949393] [2022-12-06 01:02:54,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:54,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:02:54,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:54,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:02:54,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:02:54,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 01:02:54,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 491 transitions, 6760 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:54,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:54,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 01:02:54,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:57,019 INFO L130 PetriNetUnfolder]: 12712/17351 cut-off events. [2022-12-06 01:02:57,020 INFO L131 PetriNetUnfolder]: For 6648/6648 co-relation queries the response was YES. [2022-12-06 01:02:57,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132258 conditions, 17351 events. 12712/17351 cut-off events. For 6648/6648 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 91174 event pairs, 253 based on Foata normal form. 0/16389 useless extension candidates. Maximal degree in co-relation 132228. Up to 15917 conditions per place. [2022-12-06 01:02:57,115 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 379 selfloop transitions, 53 changer transitions 121/557 dead transitions. [2022-12-06 01:02:57,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 557 transitions, 8788 flow [2022-12-06 01:02:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:02:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:02:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 01:02:57,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.535483870967742 [2022-12-06 01:02:57,118 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2022-12-06 01:02:57,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:57,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 557 transitions, 8788 flow [2022-12-06 01:02:57,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 557 transitions, 8788 flow [2022-12-06 01:02:57,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:57,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:57,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 01:02:57,237 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 557 transitions, 8788 flow [2022-12-06 01:02:57,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:02:57,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:57,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:57,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:02:57,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1685711541, now seen corresponding path program 1 times [2022-12-06 01:02:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:57,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612190327] [2022-12-06 01:02:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:57,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612190327] [2022-12-06 01:02:57,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612190327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:57,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:57,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:02:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964953953] [2022-12-06 01:02:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:57,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:02:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:02:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:02:57,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:02:57,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 557 transitions, 8788 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:02:57,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:57,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:02:57,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:02:59,377 INFO L130 PetriNetUnfolder]: 10431/14714 cut-off events. [2022-12-06 01:02:59,377 INFO L131 PetriNetUnfolder]: For 8590/8590 co-relation queries the response was YES. [2022-12-06 01:02:59,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125517 conditions, 14714 events. 10431/14714 cut-off events. For 8590/8590 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 81051 event pairs, 170 based on Foata normal form. 710/14495 useless extension candidates. Maximal degree in co-relation 125484. Up to 13598 conditions per place. [2022-12-06 01:02:59,454 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 486 selfloop transitions, 65 changer transitions 560/1133 dead transitions. [2022-12-06 01:02:59,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 1133 transitions, 20205 flow [2022-12-06 01:02:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:02:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:02:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-06 01:02:59,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2022-12-06 01:02:59,457 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2022-12-06 01:02:59,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:02:59,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 1133 transitions, 20205 flow [2022-12-06 01:02:59,569 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 1133 transitions, 20205 flow [2022-12-06 01:02:59,569 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:02:59,575 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:02:59,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 01:02:59,576 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 1133 transitions, 20205 flow [2022-12-06 01:02:59,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:02:59,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:02:59,576 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:02:59,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:02:59,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:02:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:02:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1857986735, now seen corresponding path program 1 times [2022-12-06 01:02:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:02:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714340040] [2022-12-06 01:02:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:02:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:02:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:02:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:02:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:02:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714340040] [2022-12-06 01:02:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714340040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:02:59,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:02:59,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:02:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674981705] [2022-12-06 01:02:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:02:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:02:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:02:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:02:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:02:59,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:02:59,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 1133 transitions, 20205 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:02:59,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:02:59,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:02:59,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:03:01,985 INFO L130 PetriNetUnfolder]: 8103/11646 cut-off events. [2022-12-06 01:03:01,985 INFO L131 PetriNetUnfolder]: For 9823/9823 co-relation queries the response was YES. [2022-12-06 01:03:02,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109841 conditions, 11646 events. 8103/11646 cut-off events. For 9823/9823 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 63829 event pairs, 46 based on Foata normal form. 480/11262 useless extension candidates. Maximal degree in co-relation 109805. Up to 10725 conditions per place. [2022-12-06 01:03:02,036 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 474 selfloop transitions, 118 changer transitions 939/1548 dead transitions. [2022-12-06 01:03:02,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 1548 transitions, 30756 flow [2022-12-06 01:03:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:03:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:03:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2022-12-06 01:03:02,037 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6267281105990783 [2022-12-06 01:03:02,037 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2022-12-06 01:03:02,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:03:02,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 1548 transitions, 30756 flow [2022-12-06 01:03:02,122 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 1548 transitions, 30756 flow [2022-12-06 01:03:02,122 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:03:02,129 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:03:02,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-06 01:03:02,130 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 1548 transitions, 30756 flow [2022-12-06 01:03:02,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:03:02,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:03:02,130 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:03:02,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:03:02,131 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:03:02,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:03:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash 148959314, now seen corresponding path program 1 times [2022-12-06 01:03:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:03:02,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885137778] [2022-12-06 01:03:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:03:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:03:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:03:02,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:03:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:03:02,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885137778] [2022-12-06 01:03:02,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885137778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:03:02,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:03:02,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:03:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992755573] [2022-12-06 01:03:02,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:03:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:03:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:03:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:03:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:03:02,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 01:03:02,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 1548 transitions, 30756 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:02,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:03:02,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 01:03:02,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:03:05,845 INFO L130 PetriNetUnfolder]: 10706/15530 cut-off events. [2022-12-06 01:03:05,846 INFO L131 PetriNetUnfolder]: For 16201/16201 co-relation queries the response was YES. [2022-12-06 01:03:05,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163220 conditions, 15530 events. 10706/15530 cut-off events. For 16201/16201 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 91173 event pairs, 56 based on Foata normal form. 0/14404 useless extension candidates. Maximal degree in co-relation 163181. Up to 14384 conditions per place. [2022-12-06 01:03:05,907 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 529 selfloop transitions, 52 changer transitions 1798/2379 dead transitions. [2022-12-06 01:03:05,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 2379 transitions, 51985 flow [2022-12-06 01:03:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:03:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:03:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 01:03:05,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-06 01:03:05,909 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2022-12-06 01:03:05,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:03:05,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 2379 transitions, 51985 flow [2022-12-06 01:03:06,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 2379 transitions, 51985 flow [2022-12-06 01:03:06,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:03:06,040 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:03:06,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-06 01:03:06,041 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 2379 transitions, 51985 flow [2022-12-06 01:03:06,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:06,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:03:06,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:03:06,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:03:06,041 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:03:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:03:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1525144262, now seen corresponding path program 1 times [2022-12-06 01:03:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:03:06,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130301265] [2022-12-06 01:03:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:03:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:03:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:03:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:03:06,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:03:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130301265] [2022-12-06 01:03:06,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130301265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:03:06,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:03:06,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:03:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783638144] [2022-12-06 01:03:06,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:03:06,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:03:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:03:06,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:03:06,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:03:06,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:03:06,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 2379 transitions, 51985 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:06,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:03:06,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:03:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:03:10,819 INFO L130 PetriNetUnfolder]: 9778/14116 cut-off events. [2022-12-06 01:03:10,820 INFO L131 PetriNetUnfolder]: For 20949/20949 co-relation queries the response was YES. [2022-12-06 01:03:10,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161063 conditions, 14116 events. 9778/14116 cut-off events. For 20949/20949 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 81223 event pairs, 13 based on Foata normal form. 248/13275 useless extension candidates. Maximal degree in co-relation 161021. Up to 13031 conditions per place. [2022-12-06 01:03:10,866 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 409 selfloop transitions, 134 changer transitions 2031/2586 dead transitions. [2022-12-06 01:03:10,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 2586 transitions, 61683 flow [2022-12-06 01:03:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 01:03:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 01:03:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2022-12-06 01:03:10,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057347670250897 [2022-12-06 01:03:10,873 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2022-12-06 01:03:10,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:03:10,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 2586 transitions, 61683 flow [2022-12-06 01:03:10,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 2586 transitions, 61683 flow [2022-12-06 01:03:10,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:03:10,991 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:03:10,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-06 01:03:10,992 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 2586 transitions, 61683 flow [2022-12-06 01:03:10,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:10,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:03:10,992 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:03:10,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:03:10,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:03:10,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:03:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash -532720375, now seen corresponding path program 1 times [2022-12-06 01:03:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:03:10,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788232908] [2022-12-06 01:03:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:03:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:03:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:03:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:03:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:03:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788232908] [2022-12-06 01:03:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788232908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:03:11,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:03:11,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:03:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756022633] [2022-12-06 01:03:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:03:11,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:03:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:03:11,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:03:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:03:11,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:03:11,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 2586 transitions, 61683 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:11,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:03:11,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:03:11,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:03:18,620 INFO L130 PetriNetUnfolder]: 14797/21545 cut-off events. [2022-12-06 01:03:18,620 INFO L131 PetriNetUnfolder]: For 75032/75032 co-relation queries the response was YES. [2022-12-06 01:03:18,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265260 conditions, 21545 events. 14797/21545 cut-off events. For 75032/75032 co-relation queries the response was YES. Maximal size of possible extension queue 1248. Compared 135260 event pairs, 9 based on Foata normal form. 0/19895 useless extension candidates. Maximal degree in co-relation 265215. Up to 19977 conditions per place. [2022-12-06 01:03:18,690 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 490 selfloop transitions, 18 changer transitions 4186/4704 dead transitions. [2022-12-06 01:03:18,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 4704 transitions, 121854 flow [2022-12-06 01:03:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:03:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:03:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 01:03:18,692 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2022-12-06 01:03:18,692 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2022-12-06 01:03:18,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:03:18,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 4704 transitions, 121854 flow [2022-12-06 01:03:18,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 4704 transitions, 121854 flow [2022-12-06 01:03:18,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:03:18,889 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:03:18,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 01:03:18,889 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 4704 transitions, 121854 flow [2022-12-06 01:03:18,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:18,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:03:18,890 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:03:18,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 01:03:18,890 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:03:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:03:18,891 INFO L85 PathProgramCache]: Analyzing trace with hash 346335049, now seen corresponding path program 1 times [2022-12-06 01:03:18,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:03:18,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768853930] [2022-12-06 01:03:18,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:03:18,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:03:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:03:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:03:19,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:03:19,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768853930] [2022-12-06 01:03:19,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768853930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:03:19,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:03:19,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:03:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216276330] [2022-12-06 01:03:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:03:19,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:03:19,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:03:19,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:03:19,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:03:19,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 01:03:19,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 4704 transitions, 121854 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:19,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:03:19,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 01:03:19,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:03:37,826 INFO L130 PetriNetUnfolder]: 17167/25394 cut-off events. [2022-12-06 01:03:37,826 INFO L131 PetriNetUnfolder]: For 98065/98065 co-relation queries the response was YES. [2022-12-06 01:03:37,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337892 conditions, 25394 events. 17167/25394 cut-off events. For 98065/98065 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 169350 event pairs, 14 based on Foata normal form. 0/23433 useless extension candidates. Maximal degree in co-relation 337844. Up to 23826 conditions per place. [2022-12-06 01:03:37,922 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 378 selfloop transitions, 76 changer transitions 5138/5594 dead transitions. [2022-12-06 01:03:37,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 5594 transitions, 156095 flow [2022-12-06 01:03:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:03:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:03:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 01:03:37,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43870967741935485 [2022-12-06 01:03:37,923 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2022-12-06 01:03:37,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:03:37,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 5594 transitions, 156095 flow [2022-12-06 01:03:38,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 5594 transitions, 156095 flow [2022-12-06 01:03:38,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:03:38,366 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:03:38,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 443 [2022-12-06 01:03:38,366 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 5594 transitions, 156095 flow [2022-12-06 01:03:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:03:38,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:03:38,367 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:03:38,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 01:03:38,367 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:03:38,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:03:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash 820904073, now seen corresponding path program 2 times [2022-12-06 01:03:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:03:38,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450702508] [2022-12-06 01:03:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:03:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:03:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:03:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:03:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:03:38,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450702508] [2022-12-06 01:03:38,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450702508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:03:38,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:03:38,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:03:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439982072] [2022-12-06 01:03:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:03:38,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:03:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:03:38,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:03:38,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:03:38,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:03:38,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 5594 transitions, 156095 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:03:38,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:03:38,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:03:38,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:02,040 INFO L130 PetriNetUnfolder]: 16944/24951 cut-off events. [2022-12-06 01:04:02,041 INFO L131 PetriNetUnfolder]: For 120900/120900 co-relation queries the response was YES. [2022-12-06 01:04:02,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354636 conditions, 24951 events. 16944/24951 cut-off events. For 120900/120900 co-relation queries the response was YES. Maximal size of possible extension queue 1504. Compared 165500 event pairs, 0 based on Foata normal form. 132/23131 useless extension candidates. Maximal degree in co-relation 354585. Up to 23392 conditions per place. [2022-12-06 01:04:02,130 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 144 selfloop transitions, 99 changer transitions 5382/5631 dead transitions. [2022-12-06 01:04:02,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 5631 transitions, 168363 flow [2022-12-06 01:04:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 01:04:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 01:04:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2022-12-06 01:04:02,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5131964809384164 [2022-12-06 01:04:02,133 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2022-12-06 01:04:02,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:02,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 5631 transitions, 168363 flow [2022-12-06 01:04:02,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 5631 transitions, 168363 flow [2022-12-06 01:04:02,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:02,362 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:02,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 01:04:02,363 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 5631 transitions, 168363 flow [2022-12-06 01:04:02,363 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:04:02,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:04:02,363 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] [2022-12-06 01:04:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 01:04:02,364 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:04:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:04:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1076912236, now seen corresponding path program 1 times [2022-12-06 01:04:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:04:02,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004738076] [2022-12-06 01:04:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:04:02,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:04:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:04:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:04:02,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:04:02,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004738076] [2022-12-06 01:04:02,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004738076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:04:02,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:04:02,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:04:02,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855842727] [2022-12-06 01:04:02,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:04:02,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:04:02,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:04:02,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:04:02,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:04:02,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 01:04:02,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 5631 transitions, 168363 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:02,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:04:02,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 01:04:02,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:04:34,573 INFO L130 PetriNetUnfolder]: 21936/32848 cut-off events. [2022-12-06 01:04:34,573 INFO L131 PetriNetUnfolder]: For 192820/192820 co-relation queries the response was YES. [2022-12-06 01:04:34,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498918 conditions, 32848 events. 21936/32848 cut-off events. For 192820/192820 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 235374 event pairs, 0 based on Foata normal form. 0/30257 useless extension candidates. Maximal degree in co-relation 498864. Up to 30927 conditions per place. [2022-12-06 01:04:34,693 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 0 selfloop transitions, 0 changer transitions 8086/8086 dead transitions. [2022-12-06 01:04:34,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 8086 transitions, 258057 flow [2022-12-06 01:04:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:04:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:04:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 01:04:34,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 01:04:34,694 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2022-12-06 01:04:34,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:04:34,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 8086 transitions, 258057 flow [2022-12-06 01:04:35,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 8086 transitions, 258057 flow [2022-12-06 01:04:35,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:04:35,174 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:04:35,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-06 01:04:35,174 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 8086 transitions, 258057 flow [2022-12-06 01:04:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:04:35,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 01:04:35,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 01:04:35,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 01:04:35,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 01:04:35,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 01:04:35,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 01:04:35,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 01:04:35,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 01:04:35,178 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:04:35,182 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:04:35,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:04:35,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:04:35 BasicIcfg [2022-12-06 01:04:35,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:04:35,184 INFO L158 Benchmark]: Toolchain (without parser) took 117687.89ms. Allocated memory was 220.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 194.8MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 01:04:35,185 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 220.2MB. Free memory is still 196.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:04:35,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.28ms. Allocated memory is still 220.2MB. Free memory was 194.3MB in the beginning and 166.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 01:04:35,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 220.2MB. Free memory was 166.5MB in the beginning and 163.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:04:35,185 INFO L158 Benchmark]: Boogie Preprocessor took 33.60ms. Allocated memory is still 220.2MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:04:35,185 INFO L158 Benchmark]: RCFGBuilder took 580.74ms. Allocated memory is still 220.2MB. Free memory was 161.8MB in the beginning and 126.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 01:04:35,185 INFO L158 Benchmark]: TraceAbstraction took 116529.48ms. Allocated memory was 220.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 125.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-06 01:04:35,188 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.27ms. Allocated memory is still 220.2MB. Free memory is still 196.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.28ms. Allocated memory is still 220.2MB. Free memory was 194.3MB in the beginning and 166.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 220.2MB. Free memory was 166.5MB in the beginning and 163.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.60ms. Allocated memory is still 220.2MB. Free memory was 163.9MB in the beginning and 161.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 580.74ms. Allocated memory is still 220.2MB. Free memory was 161.8MB in the beginning and 126.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 116529.48ms. Allocated memory was 220.2MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 125.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 136 PlacesBefore, 45 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 2084, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1869, independent: 1822, independent conditional: 0, independent unconditional: 1822, 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: 1869, independent: 1794, independent conditional: 0, independent unconditional: 1794, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2156, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 1869, unknown conditional: 0, unknown unconditional: 1869] , Statistics on independence cache: Total cache size (in pairs): 2641, Positive cache size: 2594, Positive conditional cache size: 0, Positive unconditional cache size: 2594, 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.2s, 45 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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, 45 PlacesBefore, 45 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 66 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, 48 PlacesBefore, 48 PlacesAfterwards, 155 TransitionsBefore, 155 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, 51 PlacesBefore, 51 PlacesAfterwards, 247 TransitionsBefore, 247 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, 375 TransitionsBefore, 375 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, 62 PlacesBefore, 62 PlacesAfterwards, 491 TransitionsBefore, 491 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, 66 PlacesBefore, 66 PlacesAfterwards, 557 TransitionsBefore, 557 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, 70 PlacesBefore, 70 PlacesAfterwards, 1133 TransitionsBefore, 1133 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, 75 PlacesBefore, 75 PlacesAfterwards, 1548 TransitionsBefore, 1548 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, 78 PlacesBefore, 78 PlacesAfterwards, 2379 TransitionsBefore, 2379 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, 2586 TransitionsBefore, 2586 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, 89 PlacesBefore, 89 PlacesAfterwards, 4704 TransitionsBefore, 4704 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, 93 PlacesBefore, 93 PlacesAfterwards, 5594 TransitionsBefore, 5594 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, 5631 TransitionsBefore, 5631 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, 104 PlacesBefore, 104 PlacesAfterwards, 8086 TransitionsBefore, 8086 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, 165 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: 116.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 103.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1936 IncrementalHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 12 mSDtfsCounter, 1936 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258057occurred in iteration=15, InterpolantAutomatonStates: 81, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 2033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:04:35,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...