/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/mix013.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:00:55,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:00:55,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:00:55,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:00:55,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:00:55,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:00:55,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:00:55,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:00:55,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:00:55,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:00:55,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:00:55,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:00:55,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:00:55,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:00:55,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:00:55,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:00:55,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:00:55,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:00:55,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:00:55,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:00:55,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:00:55,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:00:55,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:00:55,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:00:55,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:00:55,693 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:00:55,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:00:55,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:00:55,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:00:55,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:00:55,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:00:55,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:00:55,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:00:55,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:00:55,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:00:55,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:00:55,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:00:55,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:00:55,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:00:55,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:00:55,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:00:55,701 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:00:55,724 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:00:55,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:00:55,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:00:55,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:00:55,726 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:00:55,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:00:55,727 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:00:55,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:00:55,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:00:55,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:00:55,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:00:55,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:00:55,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:00:55,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:00:55,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:00:55,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:00:55,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:00:55,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:00:55,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:00:55,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:00:55,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:00:55,730 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:00:56,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:00:56,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:00:56,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:00:56,055 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:00:56,057 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:00:56,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2022-12-06 01:00:57,019 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:00:57,243 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:00:57,244 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.oepc.i [2022-12-06 01:00:57,260 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59e2b620/df6e6011666a45e2b68a575dc0f10c5d/FLAGa26ceae5c [2022-12-06 01:00:57,273 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a59e2b620/df6e6011666a45e2b68a575dc0f10c5d [2022-12-06 01:00:57,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:00:57,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:00:57,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:00:57,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:00:57,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:00:57,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd94d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57, skipping insertion in model container [2022-12-06 01:00:57,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:00:57,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:00:57,435 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/mix013.oepc.i[945,958] [2022-12-06 01:00:57,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:00:57,610 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:00:57,621 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/mix013.oepc.i[945,958] [2022-12-06 01:00:57,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:00:57,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:00:57,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:00:57,701 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:00:57,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57 WrapperNode [2022-12-06 01:00:57,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:00:57,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:00:57,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:00:57,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:00:57,708 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:00:57" (1/1) ... [2022-12-06 01:00:57,746 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:00:57" (1/1) ... [2022-12-06 01:00:57,769 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 01:00:57,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:00:57,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:00:57,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:00:57,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:00:57,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,795 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:00:57,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:00:57,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:00:57,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:00:57,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (1/1) ... [2022-12-06 01:00:57,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:00:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:00:57,845 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:00:57,856 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:00:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:00:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:00:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:00:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:00:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:00:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:00:57,885 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:00:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:00:57,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:00:57,886 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:00:57,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:00:57,886 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 01:00:57,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 01:00:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:00:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:00:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:00:57,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:00:57,888 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:00:58,043 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:00:58,045 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:00:58,401 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:00:58,514 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:00:58,514 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:00:58,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:00:58 BoogieIcfgContainer [2022-12-06 01:00:58,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:00:58,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:00:58,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:00:58,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:00:58,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:00:57" (1/3) ... [2022-12-06 01:00:58,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4856a7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:00:58, skipping insertion in model container [2022-12-06 01:00:58,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:00:57" (2/3) ... [2022-12-06 01:00:58,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4856a7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:00:58, skipping insertion in model container [2022-12-06 01:00:58,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:00:58" (3/3) ... [2022-12-06 01:00:58,527 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.oepc.i [2022-12-06 01:00:58,543 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:00:58,544 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 01:00:58,544 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:00:58,659 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:00:58,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-12-06 01:00:58,746 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-06 01:00:58,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:00:58,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 01:00:58,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-12-06 01:00:58,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-12-06 01:00:58,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:00:58,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-06 01:00:58,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-12-06 01:00:58,796 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-06 01:00:58,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:00:58,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 01:00:58,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-06 01:00:58,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-06 01:01:03,453 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-06 01:01:03,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:01:03,477 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;@36a53577, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:01:03,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 01:01:03,481 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 01:01:03,481 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:01:03,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:03,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 01:01:03,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 559283, now seen corresponding path program 1 times [2022-12-06 01:01:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:03,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136342260] [2022-12-06 01:01:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:03,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:03,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136342260] [2022-12-06 01:01:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136342260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:03,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:01:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822893232] [2022-12-06 01:01:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:03,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:01:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:01:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:01:03,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 01:01:03,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:03,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:03,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 01:01:03,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:04,834 INFO L130 PetriNetUnfolder]: 6050/8334 cut-off events. [2022-12-06 01:01:04,835 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 01:01:04,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16733 conditions, 8334 events. 6050/8334 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 42967 event pairs, 3098 based on Foata normal form. 0/7584 useless extension candidates. Maximal degree in co-relation 16721. Up to 6574 conditions per place. [2022-12-06 01:01:04,884 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 01:01:04,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-06 01:01:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:01:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:01:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 01:01:04,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-06 01:01:04,896 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-06 01:01:04,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:04,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 58 transitions, 243 flow [2022-12-06 01:01:04,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 58 transitions, 243 flow [2022-12-06 01:01:04,938 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 01:01:05,274 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 01:01:05,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 378 [2022-12-06 01:01:05,275 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 55 transitions, 237 flow [2022-12-06 01:01:05,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:05,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:05,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:05,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:01:05,276 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1310818936, now seen corresponding path program 1 times [2022-12-06 01:01:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:05,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287712912] [2022-12-06 01:01:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:05,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287712912] [2022-12-06 01:01:05,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287712912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:05,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:05,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:01:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373207096] [2022-12-06 01:01:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:05,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:01:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:01:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:01:05,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 01:01:05,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 55 transitions, 237 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:01:05,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:05,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 01:01:05,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:06,596 INFO L130 PetriNetUnfolder]: 8155/11037 cut-off events. [2022-12-06 01:01:06,597 INFO L131 PetriNetUnfolder]: For 363/407 co-relation queries the response was YES. [2022-12-06 01:01:06,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32914 conditions, 11037 events. 8155/11037 cut-off events. For 363/407 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 54205 event pairs, 910 based on Foata normal form. 0/10175 useless extension candidates. Maximal degree in co-relation 32899. Up to 8871 conditions per place. [2022-12-06 01:01:06,644 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 60 selfloop transitions, 3 changer transitions 14/78 dead transitions. [2022-12-06 01:01:06,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 483 flow [2022-12-06 01:01:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:01:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:01:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 01:01:06,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-06 01:01:06,647 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2022-12-06 01:01:06,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:06,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 78 transitions, 483 flow [2022-12-06 01:01:06,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 78 transitions, 483 flow [2022-12-06 01:01:06,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 01:01:06,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:01:06,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 01:01:06,718 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 78 transitions, 483 flow [2022-12-06 01:01:06,718 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:01:06,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:06,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:06,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:01:06,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1271600888, now seen corresponding path program 1 times [2022-12-06 01:01:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514992012] [2022-12-06 01:01:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:06,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:06,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514992012] [2022-12-06 01:01:06,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514992012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:06,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:06,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:01:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141436256] [2022-12-06 01:01:06,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:06,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:01:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:06,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:01:06,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:01:06,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 01:01:06,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 78 transitions, 483 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:01:06,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:06,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 01:01:06,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:08,028 INFO L130 PetriNetUnfolder]: 8574/11675 cut-off events. [2022-12-06 01:01:08,028 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-06 01:01:08,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45254 conditions, 11675 events. 8574/11675 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 56907 event pairs, 683 based on Foata normal form. 0/10935 useless extension candidates. Maximal degree in co-relation 45236. Up to 8551 conditions per place. [2022-12-06 01:01:08,150 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 103 selfloop transitions, 5 changer transitions 58/166 dead transitions. [2022-12-06 01:01:08,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 166 transitions, 1343 flow [2022-12-06 01:01:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:01:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:01:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 01:01:08,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 01:01:08,152 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-06 01:01:08,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:08,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 166 transitions, 1343 flow [2022-12-06 01:01:08,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 166 transitions, 1343 flow [2022-12-06 01:01:08,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:08,197 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:08,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 01:01:08,200 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 166 transitions, 1343 flow [2022-12-06 01:01:08,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have 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:01:08,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:08,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:08,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:01:08,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1409301995, now seen corresponding path program 1 times [2022-12-06 01:01:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:08,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853380247] [2022-12-06 01:01:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:08,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:08,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853380247] [2022-12-06 01:01:08,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853380247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:08,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:08,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:01:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302847666] [2022-12-06 01:01:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:08,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:01:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:08,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:01:08,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:01:08,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:08,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 166 transitions, 1343 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:01:08,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:08,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:08,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:09,463 INFO L130 PetriNetUnfolder]: 7278/10215 cut-off events. [2022-12-06 01:01:09,463 INFO L131 PetriNetUnfolder]: For 574/574 co-relation queries the response was YES. [2022-12-06 01:01:09,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48871 conditions, 10215 events. 7278/10215 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 51689 event pairs, 315 based on Foata normal form. 480/9991 useless extension candidates. Maximal degree in co-relation 48850. Up to 7639 conditions per place. [2022-12-06 01:01:09,503 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 213 selfloop transitions, 29 changer transitions 82/328 dead transitions. [2022-12-06 01:01:09,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 328 transitions, 3307 flow [2022-12-06 01:01:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:01:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:01:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-06 01:01:09,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 01:01:09,505 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2022-12-06 01:01:09,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:09,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 328 transitions, 3307 flow [2022-12-06 01:01:09,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 328 transitions, 3307 flow [2022-12-06 01:01:09,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:09,564 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:09,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 01:01:09,565 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 328 transitions, 3307 flow [2022-12-06 01:01:09,565 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:01:09,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:09,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:09,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:01:09,566 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:09,566 INFO L85 PathProgramCache]: Analyzing trace with hash -22566610, now seen corresponding path program 1 times [2022-12-06 01:01:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:09,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244817825] [2022-12-06 01:01:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:09,737 INFO L134 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:01:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:09,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244817825] [2022-12-06 01:01:09,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244817825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:09,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:09,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:01:09,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227065326] [2022-12-06 01:01:09,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:01:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:01:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:01:09,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:09,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 328 transitions, 3307 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:01:09,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:09,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:09,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:10,709 INFO L130 PetriNetUnfolder]: 5737/8191 cut-off events. [2022-12-06 01:01:10,709 INFO L131 PetriNetUnfolder]: For 881/881 co-relation queries the response was YES. [2022-12-06 01:01:10,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46644 conditions, 8191 events. 5737/8191 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 41251 event pairs, 191 based on Foata normal form. 300/7856 useless extension candidates. Maximal degree in co-relation 46620. Up to 6133 conditions per place. [2022-12-06 01:01:10,739 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 224 selfloop transitions, 47 changer transitions 199/474 dead transitions. [2022-12-06 01:01:10,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 474 transitions, 5715 flow [2022-12-06 01:01:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:01:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:01:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-06 01:01:10,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2022-12-06 01:01:10,744 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2022-12-06 01:01:10,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:10,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 474 transitions, 5715 flow [2022-12-06 01:01:10,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 474 transitions, 5715 flow [2022-12-06 01:01:10,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:10,786 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:10,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 01:01:10,788 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 474 transitions, 5715 flow [2022-12-06 01:01:10,788 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:01:10,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:10,788 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:01:10,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:01:10,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash -626608906, now seen corresponding path program 1 times [2022-12-06 01:01:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:10,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597315647] [2022-12-06 01:01:10,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:10,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597315647] [2022-12-06 01:01:10,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597315647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:10,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:10,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:01:10,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867156732] [2022-12-06 01:01:10,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:01:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:10,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:01:10,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:01:10,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:10,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 474 transitions, 5715 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:01:10,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:10,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:10,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:12,240 INFO L130 PetriNetUnfolder]: 7776/11265 cut-off events. [2022-12-06 01:01:12,240 INFO L131 PetriNetUnfolder]: For 1264/1264 co-relation queries the response was YES. [2022-12-06 01:01:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74177 conditions, 11265 events. 7776/11265 cut-off events. For 1264/1264 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 61850 event pairs, 128 based on Foata normal form. 0/10414 useless extension candidates. Maximal degree in co-relation 74150. Up to 8881 conditions per place. [2022-12-06 01:01:12,287 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 342 selfloop transitions, 15 changer transitions 502/863 dead transitions. [2022-12-06 01:01:12,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 863 transitions, 12154 flow [2022-12-06 01:01:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:01:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:01:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-06 01:01:12,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 01:01:12,291 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-06 01:01:12,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:12,291 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 863 transitions, 12154 flow [2022-12-06 01:01:12,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 863 transitions, 12154 flow [2022-12-06 01:01:12,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:12,364 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:12,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 01:01:12,365 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 863 transitions, 12154 flow [2022-12-06 01:01:12,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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:01:12,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:12,365 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:01:12,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:01:12,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash -518491370, now seen corresponding path program 2 times [2022-12-06 01:01:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548891047] [2022-12-06 01:01:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548891047] [2022-12-06 01:01:12,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548891047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:12,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:12,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 01:01:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135467882] [2022-12-06 01:01:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:12,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:01:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:01:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:01:12,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:12,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 863 transitions, 12154 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:01:12,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:12,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:14,202 INFO L130 PetriNetUnfolder]: 7074/10180 cut-off events. [2022-12-06 01:01:14,202 INFO L131 PetriNetUnfolder]: For 1805/1805 co-relation queries the response was YES. [2022-12-06 01:01:14,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76219 conditions, 10180 events. 7074/10180 cut-off events. For 1805/1805 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 54734 event pairs, 111 based on Foata normal form. 161/9533 useless extension candidates. Maximal degree in co-relation 76189. Up to 7958 conditions per place. [2022-12-06 01:01:14,239 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 241 selfloop transitions, 76 changer transitions 624/945 dead transitions. [2022-12-06 01:01:14,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 945 transitions, 15186 flow [2022-12-06 01:01:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:01:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:01:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2022-12-06 01:01:14,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 01:01:14,241 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-06 01:01:14,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:14,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 945 transitions, 15186 flow [2022-12-06 01:01:14,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 945 transitions, 15186 flow [2022-12-06 01:01:14,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:14,312 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:14,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 01:01:14,313 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 945 transitions, 15186 flow [2022-12-06 01:01:14,313 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:01:14,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:14,313 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] [2022-12-06 01:01:14,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:01:14,314 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1448504951, now seen corresponding path program 1 times [2022-12-06 01:01:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:14,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960221158] [2022-12-06 01:01:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:14,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960221158] [2022-12-06 01:01:14,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960221158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:14,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:14,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:01:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356706324] [2022-12-06 01:01:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:01:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:01:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:01:14,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:14,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 945 transitions, 15186 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:14,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:14,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:14,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:16,732 INFO L130 PetriNetUnfolder]: 9639/14057 cut-off events. [2022-12-06 01:01:16,732 INFO L131 PetriNetUnfolder]: For 5675/5675 co-relation queries the response was YES. [2022-12-06 01:01:16,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117798 conditions, 14057 events. 9639/14057 cut-off events. For 5675/5675 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 81111 event pairs, 7 based on Foata normal form. 0/12942 useless extension candidates. Maximal degree in co-relation 117765. Up to 11002 conditions per place. [2022-12-06 01:01:16,781 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 259 selfloop transitions, 13 changer transitions 1426/1701 dead transitions. [2022-12-06 01:01:16,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 1701 transitions, 30753 flow [2022-12-06 01:01:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:01:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:01:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 01:01:16,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-06 01:01:16,785 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-06 01:01:16,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:16,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 1701 transitions, 30753 flow [2022-12-06 01:01:16,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 1701 transitions, 30753 flow [2022-12-06 01:01:16,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:16,903 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:16,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 01:01:16,905 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 1701 transitions, 30753 flow [2022-12-06 01:01:16,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:16,906 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:16,906 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] [2022-12-06 01:01:16,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:01:16,906 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:16,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 541222005, now seen corresponding path program 2 times [2022-12-06 01:01:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:16,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397760066] [2022-12-06 01:01:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:17,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:17,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397760066] [2022-12-06 01:01:17,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397760066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:17,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:17,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:01:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114088888] [2022-12-06 01:01:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:17,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 01:01:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 01:01:17,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 01:01:17,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:17,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 1701 transitions, 30753 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:01:17,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:17,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:17,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:20,446 INFO L130 PetriNetUnfolder]: 9534/13820 cut-off events. [2022-12-06 01:01:20,446 INFO L131 PetriNetUnfolder]: For 7354/7354 co-relation queries the response was YES. [2022-12-06 01:01:20,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128205 conditions, 13820 events. 9534/13820 cut-off events. For 7354/7354 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 79212 event pairs, 4 based on Foata normal form. 52/12767 useless extension candidates. Maximal degree in co-relation 128169. Up to 10784 conditions per place. [2022-12-06 01:01:20,489 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 115 selfloop transitions, 51 changer transitions 1477/1645 dead transitions. [2022-12-06 01:01:20,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 1645 transitions, 33053 flow [2022-12-06 01:01:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 01:01:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 01:01:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 01:01:20,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2022-12-06 01:01:20,491 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2022-12-06 01:01:20,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:20,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 1645 transitions, 33053 flow [2022-12-06 01:01:20,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 1645 transitions, 33053 flow [2022-12-06 01:01:20,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:20,588 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:20,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 01:01:20,589 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 1645 transitions, 33053 flow [2022-12-06 01:01:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:01:20,589 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:20,589 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:20,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:01:20,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1867742189, now seen corresponding path program 1 times [2022-12-06 01:01:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902337138] [2022-12-06 01:01:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:21,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902337138] [2022-12-06 01:01:21,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902337138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:21,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:21,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 01:01:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779220727] [2022-12-06 01:01:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:21,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 01:01:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:21,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 01:01:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 01:01:21,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 01:01:21,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 1645 transitions, 33053 flow. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:01:21,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:21,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 01:01:21,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:27,605 INFO L130 PetriNetUnfolder]: 17548/25882 cut-off events. [2022-12-06 01:01:27,605 INFO L131 PetriNetUnfolder]: For 9390/9390 co-relation queries the response was YES. [2022-12-06 01:01:27,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265714 conditions, 25882 events. 17548/25882 cut-off events. For 9390/9390 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 167727 event pairs, 13 based on Foata normal form. 0/23810 useless extension candidates. Maximal degree in co-relation 265675. Up to 21949 conditions per place. [2022-12-06 01:01:27,702 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 143 selfloop transitions, 8 changer transitions 3505/3657 dead transitions. [2022-12-06 01:01:27,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 3657 transitions, 80758 flow [2022-12-06 01:01:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:01:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:01:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-06 01:01:27,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2022-12-06 01:01:27,703 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 31 predicate places. [2022-12-06 01:01:27,704 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:27,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 3657 transitions, 80758 flow [2022-12-06 01:01:28,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 3657 transitions, 80758 flow [2022-12-06 01:01:28,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:28,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:28,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-06 01:01:28,086 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 3657 transitions, 80758 flow [2022-12-06 01:01:28,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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:01:28,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:01:28,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:01:28,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:01:28,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 01:01:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:01:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2089002637, now seen corresponding path program 2 times [2022-12-06 01:01:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:01:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778248441] [2022-12-06 01:01:28,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:01:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:01:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:01:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:01:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:01:28,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778248441] [2022-12-06 01:01:28,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778248441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:01:28,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:01:28,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:01:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488649832] [2022-12-06 01:01:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:01:28,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:01:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:01:28,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:01:28,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:01:28,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 01:01:28,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 3657 transitions, 80758 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:28,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:01:28,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 01:01:28,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:01:44,331 INFO L130 PetriNetUnfolder]: 25642/38074 cut-off events. [2022-12-06 01:01:44,331 INFO L131 PetriNetUnfolder]: For 76085/76085 co-relation queries the response was YES. [2022-12-06 01:01:44,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433789 conditions, 38074 events. 25642/38074 cut-off events. For 76085/76085 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 265571 event pairs, 10 based on Foata normal form. 0/35050 useless extension candidates. Maximal degree in co-relation 433747. Up to 32825 conditions per place. [2022-12-06 01:01:44,457 INFO L137 encePairwiseOnDemand]: 22/35 looper letters, 0 selfloop transitions, 0 changer transitions 6450/6450 dead transitions. [2022-12-06 01:01:44,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 6450 transitions, 155012 flow [2022-12-06 01:01:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:01:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:01:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 01:01:44,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 01:01:44,458 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2022-12-06 01:01:44,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:01:44,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 6450 transitions, 155012 flow [2022-12-06 01:01:44,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 6450 transitions, 155012 flow [2022-12-06 01:01:44,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:01:44,776 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:01:44,777 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-06 01:01:44,777 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 6450 transitions, 155012 flow [2022-12-06 01:01:44,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:01:44,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 01:01:44,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 01:01:44,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 01:01:44,779 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 01:01:44,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 01:01:44,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 01:01:44,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 01:01:44,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:01:44,780 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2022-12-06 01:01:44,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:01:44,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:01:44,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:01:44 BasicIcfg [2022-12-06 01:01:44,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:01:44,789 INFO L158 Benchmark]: Toolchain (without parser) took 47513.44ms. Allocated memory was 189.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 164.9MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 01:01:44,789 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 167.5MB in the beginning and 167.5MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:01:44,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.64ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 136.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 01:01:44,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.92ms. Allocated memory is still 189.8MB. Free memory was 136.1MB in the beginning and 133.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 01:01:44,790 INFO L158 Benchmark]: Boogie Preprocessor took 29.19ms. Allocated memory is still 189.8MB. Free memory was 133.4MB in the beginning and 131.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 01:01:44,790 INFO L158 Benchmark]: RCFGBuilder took 716.90ms. Allocated memory is still 189.8MB. Free memory was 131.3MB in the beginning and 93.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 01:01:44,790 INFO L158 Benchmark]: TraceAbstraction took 46269.79ms. Allocated memory was 189.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 93.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 01:01:44,791 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 167.5MB in the beginning and 167.5MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.64ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 136.1MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.92ms. Allocated memory is still 189.8MB. Free memory was 136.1MB in the beginning and 133.4MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.19ms. Allocated memory is still 189.8MB. Free memory was 133.4MB in the beginning and 131.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 716.90ms. Allocated memory is still 189.8MB. Free memory was 131.3MB in the beginning and 93.6MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 46269.79ms. Allocated memory was 189.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 93.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 141 PlacesBefore, 49 PlacesAfterwards, 130 TransitionsBefore, 37 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2654, independent: 2580, independent conditional: 2580, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2654, independent: 2580, independent conditional: 0, independent unconditional: 2580, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2654, independent: 2580, independent conditional: 0, independent unconditional: 2580, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2654, independent: 2580, independent conditional: 0, independent unconditional: 2580, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1993, independent: 1949, independent conditional: 0, independent unconditional: 1949, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1993, independent: 1928, independent conditional: 0, independent unconditional: 1928, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 210, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2654, independent: 631, independent conditional: 0, independent unconditional: 631, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 1993, unknown conditional: 0, unknown unconditional: 1993] , Statistics on independence cache: Total cache size (in pairs): 3278, Positive cache size: 3234, Positive conditional cache size: 0, Positive unconditional cache size: 3234, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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.3s, 49 PlacesBefore, 46 PlacesAfterwards, 58 TransitionsBefore, 55 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 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, 48 PlacesBefore, 48 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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, 166 TransitionsBefore, 166 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, 54 PlacesBefore, 54 PlacesAfterwards, 328 TransitionsBefore, 328 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, 58 PlacesBefore, 58 PlacesAfterwards, 474 TransitionsBefore, 474 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, 61 PlacesBefore, 61 PlacesAfterwards, 863 TransitionsBefore, 863 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, 945 TransitionsBefore, 945 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, 69 PlacesBefore, 69 PlacesAfterwards, 1701 TransitionsBefore, 1701 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, 1645 TransitionsBefore, 1645 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, 80 PlacesBefore, 80 PlacesAfterwards, 3657 TransitionsBefore, 3657 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, 83 PlacesBefore, 83 PlacesAfterwards, 6450 TransitionsBefore, 6450 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, 172 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: 46.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 899 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1433 IncrementalHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 4 mSDtfsCounter, 1433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155012occurred in iteration=11, InterpolantAutomatonStates: 51, 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, 2.5s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:01:44,812 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...