/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:37:01,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:37:01,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:37:01,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:37:01,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:37:01,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:37:01,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:37:01,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:37:01,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:37:01,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:37:01,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:37:01,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:37:01,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:37:01,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:37:01,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:37:01,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:37:01,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:37:01,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:37:01,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:37:01,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:37:01,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:37:01,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:37:01,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:37:01,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:37:01,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:37:01,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:37:01,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:37:01,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:37:01,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:37:01,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:37:01,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:37:01,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:37:01,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:37:01,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:37:01,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:37:01,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:37:01,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:37:01,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:37:01,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:37:01,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:37:01,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:37:01,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:37:01,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:37:01,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:37:01,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:37:01,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:37:01,630 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:37:01,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:37:01,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:37:01,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:37:01,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:37:01,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:37:01,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:37:01,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:37:01,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:01,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:37:01,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:37:01,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:37:01,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:37:01,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:37:01,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:37:01,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:37:01,910 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:37:01,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:37:03,100 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:37:03,307 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:37:03,307 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:37:03,321 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00d7ea02/a12e75edd05d46bb832e9c70d776183d/FLAG7fa5d1bf4 [2022-12-13 09:37:03,335 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e00d7ea02/a12e75edd05d46bb832e9c70d776183d [2022-12-13 09:37:03,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:37:03,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:37:03,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:03,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:37:03,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:37:03,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03, skipping insertion in model container [2022-12-13 09:37:03,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:37:03,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:37:03,529 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 09:37:03,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:03,725 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:37:03,734 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 09:37:03,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:37:03,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:37:03,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:37:03,816 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:37:03,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03 WrapperNode [2022-12-13 09:37:03,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:37:03,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:03,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:37:03,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:37:03,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,872 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-13 09:37:03,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:37:03,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:37:03,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:37:03,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:37:03,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,896 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:37:03,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:37:03,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:37:03,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:37:03,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (1/1) ... [2022-12-13 09:37:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:37:03,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:37:03,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:37:03,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:37:03,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:37:03,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:37:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:37:03,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:37:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:37:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:37:03,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:37:03,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:37:03,999 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:37:04,130 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:37:04,131 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:37:04,361 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:37:04,498 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:37:04,498 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:37:04,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:04 BoogieIcfgContainer [2022-12-13 09:37:04,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:37:04,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:37:04,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:37:04,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:37:04,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:37:03" (1/3) ... [2022-12-13 09:37:04,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33342f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:04, skipping insertion in model container [2022-12-13 09:37:04,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:37:03" (2/3) ... [2022-12-13 09:37:04,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33342f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:37:04, skipping insertion in model container [2022-12-13 09:37:04,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:37:04" (3/3) ... [2022-12-13 09:37:04,508 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:37:04,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:37:04,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:37:04,521 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:37:04,565 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:37:04,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 09:37:04,640 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 09:37:04,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:04,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:37:04,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 09:37:04,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 09:37:04,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:04,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 09:37:04,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 09:37:04,709 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 09:37:04,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:04,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:37:04,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 09:37:04,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 09:37:08,680 INFO L241 LiptonReduction]: Total number of compositions: 85 [2022-12-13 09:37:08,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:37:08,703 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;@61f7c302, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:37:08,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:37:08,707 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 09:37:08,708 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:08,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:08,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:37:08,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:08,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 463088845, now seen corresponding path program 1 times [2022-12-13 09:37:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:08,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382984636] [2022-12-13 09:37:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382984636] [2022-12-13 09:37:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382984636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:09,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790024257] [2022-12-13 09:37:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:09,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:09,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:09,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:09,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-13 09:37:09,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:09,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:09,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-13 09:37:09,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:10,142 INFO L130 PetriNetUnfolder]: 7624/12014 cut-off events. [2022-12-13 09:37:10,142 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 09:37:10,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 12014 events. 7624/12014 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 83455 event pairs, 2133 based on Foata normal form. 0/7312 useless extension candidates. Maximal degree in co-relation 22980. Up to 9237 conditions per place. [2022-12-13 09:37:10,177 INFO L137 encePairwiseOnDemand]: 55/60 looper letters, 32 selfloop transitions, 2 changer transitions 50/95 dead transitions. [2022-12-13 09:37:10,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 370 flow [2022-12-13 09:37:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-13 09:37:10,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 09:37:10,188 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 129 flow. Second operand 3 states and 122 transitions. [2022-12-13 09:37:10,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 370 flow [2022-12-13 09:37:10,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:37:10,193 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 74 flow [2022-12-13 09:37:10,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2022-12-13 09:37:10,198 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 09:37:10,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:10,199 INFO L89 Accepts]: Start accepts. Operand has 66 places, 32 transitions, 74 flow [2022-12-13 09:37:10,201 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:10,201 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:10,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 32 transitions, 74 flow [2022-12-13 09:37:10,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 09:37:10,211 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:37:10,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:10,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:37:10,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 09:37:10,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 09:37:10,325 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:10,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 09:37:10,327 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 09:37:10,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:10,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:10,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:10,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:37:10,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash 912458532, now seen corresponding path program 1 times [2022-12-13 09:37:10,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:10,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567936901] [2022-12-13 09:37:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:10,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:10,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567936901] [2022-12-13 09:37:10,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567936901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:10,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:10,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221178830] [2022-12-13 09:37:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:10,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:10,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 09:37:10,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:10,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:10,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 09:37:10,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:10,824 INFO L130 PetriNetUnfolder]: 1736/2690 cut-off events. [2022-12-13 09:37:10,825 INFO L131 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2022-12-13 09:37:10,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 2690 events. 1736/2690 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13847 event pairs, 446 based on Foata normal form. 0/2103 useless extension candidates. Maximal degree in co-relation 5441. Up to 2402 conditions per place. [2022-12-13 09:37:10,852 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 32 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2022-12-13 09:37:10,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 182 flow [2022-12-13 09:37:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 09:37:10,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 09:37:10,855 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 65 transitions. [2022-12-13 09:37:10,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 182 flow [2022-12-13 09:37:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:10,857 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 87 flow [2022-12-13 09:37:10,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-13 09:37:10,858 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -27 predicate places. [2022-12-13 09:37:10,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:10,858 INFO L89 Accepts]: Start accepts. Operand has 42 places, 33 transitions, 87 flow [2022-12-13 09:37:10,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:10,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:10,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 87 flow [2022-12-13 09:37:10,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 87 flow [2022-12-13 09:37:10,864 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 09:37:10,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:37:10,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 47 events. 3/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2022-12-13 09:37:10,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 87 flow [2022-12-13 09:37:10,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-13 09:37:10,972 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:10,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 09:37:10,973 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 87 flow [2022-12-13 09:37:10,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:10,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:10,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:10,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:37:10,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1778556934, now seen corresponding path program 1 times [2022-12-13 09:37:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789628347] [2022-12-13 09:37:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:11,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:11,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789628347] [2022-12-13 09:37:11,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789628347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:11,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:11,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:37:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709470694] [2022-12-13 09:37:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:11,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:11,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:11,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:11,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:11,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:37:11,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:11,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:11,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:37:11,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:11,333 INFO L130 PetriNetUnfolder]: 1859/2909 cut-off events. [2022-12-13 09:37:11,333 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-13 09:37:11,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6218 conditions, 2909 events. 1859/2909 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14621 event pairs, 231 based on Foata normal form. 30/2491 useless extension candidates. Maximal degree in co-relation 6207. Up to 1689 conditions per place. [2022-12-13 09:37:11,348 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 55 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2022-12-13 09:37:11,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 325 flow [2022-12-13 09:37:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:37:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:37:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 09:37:11,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6838709677419355 [2022-12-13 09:37:11,350 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 87 flow. Second operand 5 states and 106 transitions. [2022-12-13 09:37:11,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 325 flow [2022-12-13 09:37:11,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:37:11,351 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 164 flow [2022-12-13 09:37:11,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-13 09:37:11,352 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2022-12-13 09:37:11,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:11,352 INFO L89 Accepts]: Start accepts. Operand has 47 places, 41 transitions, 164 flow [2022-12-13 09:37:11,353 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:11,353 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:11,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 41 transitions, 164 flow [2022-12-13 09:37:11,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 164 flow [2022-12-13 09:37:11,362 INFO L130 PetriNetUnfolder]: 19/112 cut-off events. [2022-12-13 09:37:11,362 INFO L131 PetriNetUnfolder]: For 47/61 co-relation queries the response was YES. [2022-12-13 09:37:11,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 112 events. 19/112 cut-off events. For 47/61 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 222. Up to 29 conditions per place. [2022-12-13 09:37:11,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 41 transitions, 164 flow [2022-12-13 09:37:11,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 680 [2022-12-13 09:37:11,431 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:11,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 09:37:11,433 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 164 flow [2022-12-13 09:37:11,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:11,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:11,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:11,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:37:11,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2099040965, now seen corresponding path program 1 times [2022-12-13 09:37:11,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820981369] [2022-12-13 09:37:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:11,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820981369] [2022-12-13 09:37:11,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820981369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:11,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:11,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:37:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677860028] [2022-12-13 09:37:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:11,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:37:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:37:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:37:11,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2022-12-13 09:37:11,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:11,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:11,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2022-12-13 09:37:11,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:11,746 INFO L130 PetriNetUnfolder]: 1523/2493 cut-off events. [2022-12-13 09:37:11,746 INFO L131 PetriNetUnfolder]: For 1915/1915 co-relation queries the response was YES. [2022-12-13 09:37:11,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 2493 events. 1523/2493 cut-off events. For 1915/1915 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13402 event pairs, 395 based on Foata normal form. 18/2089 useless extension candidates. Maximal degree in co-relation 6316. Up to 1822 conditions per place. [2022-12-13 09:37:11,763 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2022-12-13 09:37:11,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 256 flow [2022-12-13 09:37:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:37:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:37:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 09:37:11,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:37:11,764 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 164 flow. Second operand 3 states and 62 transitions. [2022-12-13 09:37:11,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 256 flow [2022-12-13 09:37:11,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:37:11,768 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 175 flow [2022-12-13 09:37:11,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-13 09:37:11,768 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -20 predicate places. [2022-12-13 09:37:11,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:11,769 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 175 flow [2022-12-13 09:37:11,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:11,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:11,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 175 flow [2022-12-13 09:37:11,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 175 flow [2022-12-13 09:37:11,776 INFO L130 PetriNetUnfolder]: 17/91 cut-off events. [2022-12-13 09:37:11,776 INFO L131 PetriNetUnfolder]: For 71/80 co-relation queries the response was YES. [2022-12-13 09:37:11,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 91 events. 17/91 cut-off events. For 71/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 406 event pairs, 0 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 194. Up to 27 conditions per place. [2022-12-13 09:37:11,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 175 flow [2022-12-13 09:37:11,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 678 [2022-12-13 09:37:11,825 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:11,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 09:37:11,826 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 175 flow [2022-12-13 09:37:11,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:11,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:11,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:11,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:37:11,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 699306564, now seen corresponding path program 1 times [2022-12-13 09:37:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028207257] [2022-12-13 09:37:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028207257] [2022-12-13 09:37:11,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028207257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:11,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:11,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902824071] [2022-12-13 09:37:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:11,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:37:11,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:11,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:11,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:37:11,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:12,200 INFO L130 PetriNetUnfolder]: 2216/3524 cut-off events. [2022-12-13 09:37:12,200 INFO L131 PetriNetUnfolder]: For 3653/3653 co-relation queries the response was YES. [2022-12-13 09:37:12,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8762 conditions, 3524 events. 2216/3524 cut-off events. For 3653/3653 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18985 event pairs, 619 based on Foata normal form. 138/3063 useless extension candidates. Maximal degree in co-relation 8745. Up to 1360 conditions per place. [2022-12-13 09:37:12,217 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 37 selfloop transitions, 5 changer transitions 16/66 dead transitions. [2022-12-13 09:37:12,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 363 flow [2022-12-13 09:37:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:37:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:37:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 09:37:12,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6693548387096774 [2022-12-13 09:37:12,218 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 175 flow. Second operand 4 states and 83 transitions. [2022-12-13 09:37:12,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 363 flow [2022-12-13 09:37:12,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:12,222 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 146 flow [2022-12-13 09:37:12,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2022-12-13 09:37:12,223 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -17 predicate places. [2022-12-13 09:37:12,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:12,223 INFO L89 Accepts]: Start accepts. Operand has 52 places, 35 transitions, 146 flow [2022-12-13 09:37:12,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:12,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:12,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 35 transitions, 146 flow [2022-12-13 09:37:12,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 35 transitions, 146 flow [2022-12-13 09:37:12,228 INFO L130 PetriNetUnfolder]: 7/60 cut-off events. [2022-12-13 09:37:12,228 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-12-13 09:37:12,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 60 events. 7/60 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 177 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 128. Up to 15 conditions per place. [2022-12-13 09:37:12,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 35 transitions, 146 flow [2022-12-13 09:37:12,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 09:37:12,265 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:12,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 09:37:12,266 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 146 flow [2022-12-13 09:37:12,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:12,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:12,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:12,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:37:12,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash -955970896, now seen corresponding path program 1 times [2022-12-13 09:37:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:12,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637109260] [2022-12-13 09:37:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:12,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:12,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637109260] [2022-12-13 09:37:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637109260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:12,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:12,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:12,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072423832] [2022-12-13 09:37:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:12,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:12,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:12,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:37:12,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:12,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:12,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:37:12,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:12,603 INFO L130 PetriNetUnfolder]: 1864/2921 cut-off events. [2022-12-13 09:37:12,604 INFO L131 PetriNetUnfolder]: For 4711/4777 co-relation queries the response was YES. [2022-12-13 09:37:12,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8094 conditions, 2921 events. 1864/2921 cut-off events. For 4711/4777 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 15454 event pairs, 511 based on Foata normal form. 210/2159 useless extension candidates. Maximal degree in co-relation 8075. Up to 2218 conditions per place. [2022-12-13 09:37:12,618 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 38 selfloop transitions, 10 changer transitions 36/92 dead transitions. [2022-12-13 09:37:12,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 92 transitions, 516 flow [2022-12-13 09:37:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:37:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:37:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 09:37:12,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7161290322580646 [2022-12-13 09:37:12,619 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 146 flow. Second operand 5 states and 111 transitions. [2022-12-13 09:37:12,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 92 transitions, 516 flow [2022-12-13 09:37:12,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 465 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 09:37:12,622 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 211 flow [2022-12-13 09:37:12,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-13 09:37:12,623 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -16 predicate places. [2022-12-13 09:37:12,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:12,623 INFO L89 Accepts]: Start accepts. Operand has 53 places, 44 transitions, 211 flow [2022-12-13 09:37:12,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:12,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:12,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 211 flow [2022-12-13 09:37:12,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 211 flow [2022-12-13 09:37:12,671 INFO L130 PetriNetUnfolder]: 507/879 cut-off events. [2022-12-13 09:37:12,671 INFO L131 PetriNetUnfolder]: For 864/1180 co-relation queries the response was YES. [2022-12-13 09:37:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 879 events. 507/879 cut-off events. For 864/1180 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 5425 event pairs, 279 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 2696. Up to 634 conditions per place. [2022-12-13 09:37:12,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 211 flow [2022-12-13 09:37:12,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 09:37:12,714 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:12,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 09:37:12,715 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 211 flow [2022-12-13 09:37:12,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:12,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:12,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:12,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:37:12,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash 127279579, now seen corresponding path program 1 times [2022-12-13 09:37:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648727128] [2022-12-13 09:37:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648727128] [2022-12-13 09:37:12,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648727128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:12,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:12,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:37:12,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345260797] [2022-12-13 09:37:12,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:12,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:12,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:12,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:37:12,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:12,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:12,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:37:12,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:13,019 INFO L130 PetriNetUnfolder]: 1109/1929 cut-off events. [2022-12-13 09:37:13,020 INFO L131 PetriNetUnfolder]: For 2007/2031 co-relation queries the response was YES. [2022-12-13 09:37:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6985 conditions, 1929 events. 1109/1929 cut-off events. For 2007/2031 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10781 event pairs, 130 based on Foata normal form. 180/1504 useless extension candidates. Maximal degree in co-relation 6967. Up to 1054 conditions per place. [2022-12-13 09:37:13,030 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 45 selfloop transitions, 19 changer transitions 32/104 dead transitions. [2022-12-13 09:37:13,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 104 transitions, 695 flow [2022-12-13 09:37:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:37:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:37:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-13 09:37:13,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7150537634408602 [2022-12-13 09:37:13,031 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 211 flow. Second operand 6 states and 133 transitions. [2022-12-13 09:37:13,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 104 transitions, 695 flow [2022-12-13 09:37:13,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 104 transitions, 683 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:13,039 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 351 flow [2022-12-13 09:37:13,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2022-12-13 09:37:13,039 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -12 predicate places. [2022-12-13 09:37:13,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:13,039 INFO L89 Accepts]: Start accepts. Operand has 57 places, 53 transitions, 351 flow [2022-12-13 09:37:13,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:13,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:13,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions, 351 flow [2022-12-13 09:37:13,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 53 transitions, 351 flow [2022-12-13 09:37:13,078 INFO L130 PetriNetUnfolder]: 300/609 cut-off events. [2022-12-13 09:37:13,079 INFO L131 PetriNetUnfolder]: For 1098/1669 co-relation queries the response was YES. [2022-12-13 09:37:13,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 609 events. 300/609 cut-off events. For 1098/1669 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 3663 event pairs, 90 based on Foata normal form. 4/346 useless extension candidates. Maximal degree in co-relation 2681. Up to 421 conditions per place. [2022-12-13 09:37:13,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 53 transitions, 351 flow [2022-12-13 09:37:13,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 09:37:13,093 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:37:13,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 09:37:13,094 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 351 flow [2022-12-13 09:37:13,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:13,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:13,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:13,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:37:13,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 125882945, now seen corresponding path program 1 times [2022-12-13 09:37:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:13,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522434022] [2022-12-13 09:37:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:13,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522434022] [2022-12-13 09:37:13,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522434022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:13,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:13,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:37:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263099431] [2022-12-13 09:37:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:13,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:37:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:37:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:37:13,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:37:13,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:13,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:13,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:37:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:13,504 INFO L130 PetriNetUnfolder]: 539/1053 cut-off events. [2022-12-13 09:37:13,504 INFO L131 PetriNetUnfolder]: For 1229/1229 co-relation queries the response was YES. [2022-12-13 09:37:13,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 1053 events. 539/1053 cut-off events. For 1229/1229 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5605 event pairs, 40 based on Foata normal form. 108/832 useless extension candidates. Maximal degree in co-relation 4483. Up to 574 conditions per place. [2022-12-13 09:37:13,509 INFO L137 encePairwiseOnDemand]: 19/31 looper letters, 36 selfloop transitions, 28 changer transitions 15/87 dead transitions. [2022-12-13 09:37:13,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 697 flow [2022-12-13 09:37:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:37:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:37:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-13 09:37:13,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.576036866359447 [2022-12-13 09:37:13,510 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 351 flow. Second operand 7 states and 125 transitions. [2022-12-13 09:37:13,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 697 flow [2022-12-13 09:37:13,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 586 flow, removed 42 selfloop flow, removed 5 redundant places. [2022-12-13 09:37:13,523 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 342 flow [2022-12-13 09:37:13,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-12-13 09:37:13,524 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -10 predicate places. [2022-12-13 09:37:13,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:13,524 INFO L89 Accepts]: Start accepts. Operand has 59 places, 53 transitions, 342 flow [2022-12-13 09:37:13,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:13,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:13,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 342 flow [2022-12-13 09:37:13,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 342 flow [2022-12-13 09:37:13,539 INFO L130 PetriNetUnfolder]: 93/276 cut-off events. [2022-12-13 09:37:13,539 INFO L131 PetriNetUnfolder]: For 447/628 co-relation queries the response was YES. [2022-12-13 09:37:13,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 276 events. 93/276 cut-off events. For 447/628 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1430 event pairs, 0 based on Foata normal form. 2/146 useless extension candidates. Maximal degree in co-relation 1056. Up to 181 conditions per place. [2022-12-13 09:37:13,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 53 transitions, 342 flow [2022-12-13 09:37:13,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:37:13,888 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:37:13,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 365 [2022-12-13 09:37:13,889 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 338 flow [2022-12-13 09:37:13,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:13,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:13,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:13,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:37:13,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash -18519427, now seen corresponding path program 1 times [2022-12-13 09:37:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:13,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025257634] [2022-12-13 09:37:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:14,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025257634] [2022-12-13 09:37:14,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025257634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:14,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:14,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:37:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084968003] [2022-12-13 09:37:14,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:14,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:37:14,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:14,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:37:14,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:37:14,008 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2022-12-13 09:37:14,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:14,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:14,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2022-12-13 09:37:14,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:14,151 INFO L130 PetriNetUnfolder]: 521/956 cut-off events. [2022-12-13 09:37:14,151 INFO L131 PetriNetUnfolder]: For 2231/2299 co-relation queries the response was YES. [2022-12-13 09:37:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 956 events. 521/956 cut-off events. For 2231/2299 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4945 event pairs, 56 based on Foata normal form. 77/809 useless extension candidates. Maximal degree in co-relation 4047. Up to 484 conditions per place. [2022-12-13 09:37:14,155 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 7 changer transitions 19/98 dead transitions. [2022-12-13 09:37:14,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 794 flow [2022-12-13 09:37:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:37:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:37:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 09:37:14,156 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6758620689655173 [2022-12-13 09:37:14,157 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 338 flow. Second operand 5 states and 98 transitions. [2022-12-13 09:37:14,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 794 flow [2022-12-13 09:37:14,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 620 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-12-13 09:37:14,167 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 270 flow [2022-12-13 09:37:14,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-13 09:37:14,167 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -14 predicate places. [2022-12-13 09:37:14,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:14,168 INFO L89 Accepts]: Start accepts. Operand has 55 places, 51 transitions, 270 flow [2022-12-13 09:37:14,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:14,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:14,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 270 flow [2022-12-13 09:37:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 270 flow [2022-12-13 09:37:14,185 INFO L130 PetriNetUnfolder]: 173/361 cut-off events. [2022-12-13 09:37:14,185 INFO L131 PetriNetUnfolder]: For 272/281 co-relation queries the response was YES. [2022-12-13 09:37:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 361 events. 173/361 cut-off events. For 272/281 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 1877 event pairs, 0 based on Foata normal form. 3/145 useless extension candidates. Maximal degree in co-relation 958. Up to 190 conditions per place. [2022-12-13 09:37:14,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 270 flow [2022-12-13 09:37:14,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-13 09:37:14,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:37:14,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 09:37:14,308 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 268 flow [2022-12-13 09:37:14,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:14,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:14,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:37:14,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1252248715, now seen corresponding path program 1 times [2022-12-13 09:37:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488679092] [2022-12-13 09:37:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:14,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488679092] [2022-12-13 09:37:14,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488679092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:14,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:14,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:37:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421310044] [2022-12-13 09:37:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:14,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:37:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:37:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:37:14,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 28 [2022-12-13 09:37:14,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:14,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:14,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 28 [2022-12-13 09:37:14,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:14,636 INFO L130 PetriNetUnfolder]: 541/988 cut-off events. [2022-12-13 09:37:14,636 INFO L131 PetriNetUnfolder]: For 1523/1580 co-relation queries the response was YES. [2022-12-13 09:37:14,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 988 events. 541/988 cut-off events. For 1523/1580 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 5422 event pairs, 36 based on Foata normal form. 64/799 useless extension candidates. Maximal degree in co-relation 3375. Up to 392 conditions per place. [2022-12-13 09:37:14,640 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 42 selfloop transitions, 3 changer transitions 34/91 dead transitions. [2022-12-13 09:37:14,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 621 flow [2022-12-13 09:37:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:37:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:37:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 09:37:14,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-13 09:37:14,641 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 268 flow. Second operand 6 states and 98 transitions. [2022-12-13 09:37:14,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 621 flow [2022-12-13 09:37:14,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:37:14,646 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 231 flow [2022-12-13 09:37:14,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-13 09:37:14,647 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -12 predicate places. [2022-12-13 09:37:14,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:14,647 INFO L89 Accepts]: Start accepts. Operand has 57 places, 44 transitions, 231 flow [2022-12-13 09:37:14,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:14,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:14,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 231 flow [2022-12-13 09:37:14,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 231 flow [2022-12-13 09:37:14,661 INFO L130 PetriNetUnfolder]: 90/210 cut-off events. [2022-12-13 09:37:14,661 INFO L131 PetriNetUnfolder]: For 362/368 co-relation queries the response was YES. [2022-12-13 09:37:14,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 210 events. 90/210 cut-off events. For 362/368 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1059 event pairs, 0 based on Foata normal form. 2/96 useless extension candidates. Maximal degree in co-relation 617. Up to 109 conditions per place. [2022-12-13 09:37:14,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 231 flow [2022-12-13 09:37:14,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 268 [2022-12-13 09:37:14,978 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:37:14,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-13 09:37:14,979 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 225 flow [2022-12-13 09:37:14,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:14,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:14,979 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:14,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:37:14,979 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:14,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1335145233, now seen corresponding path program 1 times [2022-12-13 09:37:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:14,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815703131] [2022-12-13 09:37:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:37:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:37:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:37:15,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815703131] [2022-12-13 09:37:15,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815703131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:37:15,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:37:15,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:37:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344772767] [2022-12-13 09:37:15,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:37:15,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:37:15,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:37:15,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:37:15,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:37:15,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 09:37:15,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:15,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:37:15,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 09:37:15,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:37:15,926 INFO L130 PetriNetUnfolder]: 269/515 cut-off events. [2022-12-13 09:37:15,927 INFO L131 PetriNetUnfolder]: For 1431/1453 co-relation queries the response was YES. [2022-12-13 09:37:15,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 515 events. 269/515 cut-off events. For 1431/1453 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2633 event pairs, 10 based on Foata normal form. 40/413 useless extension candidates. Maximal degree in co-relation 1804. Up to 202 conditions per place. [2022-12-13 09:37:15,929 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 3 changer transitions 34/80 dead transitions. [2022-12-13 09:37:15,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 565 flow [2022-12-13 09:37:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:37:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:37:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 09:37:15,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2022-12-13 09:37:15,930 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 225 flow. Second operand 6 states and 77 transitions. [2022-12-13 09:37:15,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 565 flow [2022-12-13 09:37:15,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 518 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 09:37:15,933 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 207 flow [2022-12-13 09:37:15,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-12-13 09:37:15,933 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -20 predicate places. [2022-12-13 09:37:15,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:37:15,933 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 207 flow [2022-12-13 09:37:15,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:37:15,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:37:15,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 207 flow [2022-12-13 09:37:15,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 207 flow [2022-12-13 09:37:15,944 INFO L130 PetriNetUnfolder]: 81/184 cut-off events. [2022-12-13 09:37:15,944 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 09:37:15,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 184 events. 81/184 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 885 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 536. Up to 109 conditions per place. [2022-12-13 09:37:15,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 207 flow [2022-12-13 09:37:15,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 09:37:15,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] $Ultimate##0-->L789: Formula: (and (= v_~x$r_buff0_thd3~0_137 v_~x$r_buff1_thd3~0_133) (= v_~x$w_buff0_used~0_523 v_~x$w_buff1_used~0_468) (= v_~x$r_buff0_thd2~0_195 v_~x$r_buff1_thd2~0_151) (= v_~y~0_65 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_41| |v_P1Thread1of1ForFork0_#in~arg#1.base_41|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_41| |v_P1Thread1of1ForFork0_~arg#1.offset_41|) (= v_~x$r_buff0_thd2~0_194 1) (= v_~x$w_buff0~0_360 1) (= v_~x$w_buff0~0_361 v_~x$w_buff1~0_326) (= v_~x$r_buff0_thd0~0_158 v_~x$r_buff1_thd0~0_152) (= v_~x$w_buff0_used~0_522 1) (= v_~x$r_buff0_thd1~0_271 v_~x$r_buff1_thd1~0_275) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_522 256) 0)) (not (= 0 (mod v_~x$w_buff1_used~0_468 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_361, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_271, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_195, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_523} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_360, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_271, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_41|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_41|, ~x$w_buff1~0=v_~x$w_buff1~0_326, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_133, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_151, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_468, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_275, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_152, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_522, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~y~0=v_~y~0_65} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [475] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= v_~__unbuffered_p2_EBX~0_144 v_~z~0_60) (= v_~y~0_67 v_~__unbuffered_p2_EAX~0_148) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_60, ~y~0=v_~y~0_67} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_144, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_148, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_60, ~y~0=v_~y~0_67} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 09:37:16,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:37:16,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 09:37:16,108 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 205 flow [2022-12-13 09:37:16,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:37:16,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:37:16,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:16,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:37:16,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:37:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:37:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1470795293, now seen corresponding path program 1 times [2022-12-13 09:37:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:37:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137867206] [2022-12-13 09:37:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:37:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:37:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:37:16,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:37:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:37:16,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:37:16,195 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:37:16,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:37:16,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:37:16,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:37:16,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:37:16,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:37:16,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:37:16,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:37:16,197 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:37:16,210 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:37:16,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:37:16,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:37:16 BasicIcfg [2022-12-13 09:37:16,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:37:16,264 INFO L158 Benchmark]: Toolchain (without parser) took 12925.86ms. Allocated memory was 181.4MB in the beginning and 602.9MB in the end (delta: 421.5MB). Free memory was 157.3MB in the beginning and 266.1MB in the end (delta: -108.8MB). Peak memory consumption was 313.8MB. Max. memory is 8.0GB. [2022-12-13 09:37:16,264 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:37:16,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.87ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 130.6MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:37:16,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.61ms. Allocated memory is still 181.4MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:37:16,265 INFO L158 Benchmark]: Boogie Preprocessor took 25.79ms. Allocated memory is still 181.4MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:37:16,265 INFO L158 Benchmark]: RCFGBuilder took 600.62ms. Allocated memory is still 181.4MB. Free memory was 126.4MB in the beginning and 155.1MB in the end (delta: -28.7MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB. [2022-12-13 09:37:16,265 INFO L158 Benchmark]: TraceAbstraction took 11762.02ms. Allocated memory was 181.4MB in the beginning and 602.9MB in the end (delta: 421.5MB). Free memory was 153.5MB in the beginning and 266.1MB in the end (delta: -112.6MB). Peak memory consumption was 309.9MB. Max. memory is 8.0GB. [2022-12-13 09:37:16,266 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.15ms. Allocated memory is still 181.4MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.87ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 130.6MB in the end (delta: 26.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.61ms. Allocated memory is still 181.4MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.79ms. Allocated memory is still 181.4MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 600.62ms. Allocated memory is still 181.4MB. Free memory was 126.4MB in the beginning and 155.1MB in the end (delta: -28.7MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB. * TraceAbstraction took 11762.02ms. Allocated memory was 181.4MB in the beginning and 602.9MB in the end (delta: 421.5MB). Free memory was 153.5MB in the beginning and 266.1MB in the end (delta: -112.6MB). Peak memory consumption was 309.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 113 PlacesBefore, 69 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 3294, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2083, independent: 2040, independent conditional: 0, independent unconditional: 2040, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2083, independent: 2040, independent conditional: 0, independent unconditional: 2040, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2083, independent: 2008, independent conditional: 0, independent unconditional: 2008, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3408, independent: 1254, independent conditional: 1254, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 2083, unknown conditional: 2083, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2087, Positive cache size: 2044, Positive conditional cache size: 2044, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 194, independent conditional: 194, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 167, independent conditional: 10, independent unconditional: 157, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 190, independent: 167, independent conditional: 10, independent unconditional: 157, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 190, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 90, dependent conditional: 13, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 190, unknown conditional: 190, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 167, Positive conditional cache size: 167, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 33, independent conditional: 9, independent unconditional: 24, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 33, independent conditional: 9, independent unconditional: 24, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 100, dependent conditional: 80, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 200, Positive conditional cache size: 200, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 680 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 44, independent conditional: 18, independent unconditional: 26, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 44, independent conditional: 18, independent unconditional: 26, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 59, dependent conditional: 44, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 244, Positive conditional cache size: 244, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 191, independent conditional: 191, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 19, independent conditional: 10, independent unconditional: 9, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 24, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, independent: 172, independent conditional: 172, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 263, Positive conditional cache size: 263, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 209, independent conditional: 209, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 9, independent unconditional: 31, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 9, independent unconditional: 31, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 26, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 303, Positive conditional cache size: 303, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 181, independent: 163, independent conditional: 163, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 10, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 16, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 325, Positive conditional cache size: 325, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 343, Positive conditional cache size: 343, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 57 PlacesBefore, 55 PlacesAfterwards, 53 TransitionsBefore, 51 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 378, independent: 328, independent conditional: 328, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 378, independent: 316, independent conditional: 316, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 355, Positive conditional cache size: 355, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 409, independent: 367, independent conditional: 367, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 21, independent unconditional: 7, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 21, independent unconditional: 7, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 409, independent: 339, independent conditional: 339, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 383, Positive conditional cache size: 383, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 305, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 32, independent conditional: 28, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 32, independent conditional: 28, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 305, independent: 215, independent conditional: 215, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 415, Positive conditional cache size: 415, Positive unconditional cache size: 0, Negative cache size: 65, Negative conditional cache size: 65, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 46 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 487, Positive cache size: 420, Positive conditional cache size: 420, Positive unconditional cache size: 0, Negative cache size: 67, Negative conditional cache size: 67, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-1, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=0, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=1, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 y = 1 [L805] 2 __unbuffered_p2_EAX = y [L808] 2 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 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: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 922 IncrementalHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 7 mSDtfsCounter, 922 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=7, InterpolantAutomatonStates: 53, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 648 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:37:16,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...