/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/safe030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:38:03,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:38:03,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:38:03,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:38:03,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:38:03,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:38:03,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:38:03,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:38:03,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:38:03,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:38:03,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:38:03,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:38:03,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:38:03,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:38:03,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:38:03,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:38:03,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:38:03,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:38:03,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:38:03,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:38:03,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:38:03,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:38:03,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:38:03,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:38:03,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:38:03,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:38:03,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:38:03,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:38:03,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:38:03,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:38:03,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:38:03,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:38:03,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:38:03,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:38:03,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:38:03,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:38:03,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:38:03,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:38:03,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:38:03,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:38:03,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:38:03,680 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:38:03,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:38:03,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:38:03,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:38:03,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:38:03,708 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:38:03,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:38:03,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:38:03,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:38:03,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:38:03,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:38:03,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:38:03,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:03,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:38:03,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:38:03,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:38:03,712 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:38:03,712 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:38:03,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:38:03,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:38:03,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:38:03,975 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:38:03,981 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:38:03,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2022-12-13 09:38:05,066 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:38:05,293 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:38:05,294 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2022-12-13 09:38:05,303 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450fb53f1/9159baf6609c4ada84c86ea5220b646a/FLAG4d56d1273 [2022-12-13 09:38:05,315 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/450fb53f1/9159baf6609c4ada84c86ea5220b646a [2022-12-13 09:38:05,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:38:05,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:38:05,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:05,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:38:05,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:38:05,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f321bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05, skipping insertion in model container [2022-12-13 09:38:05,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:38:05,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:38:05,464 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/safe030_tso.i[945,958] [2022-12-13 09:38:05,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:05,630 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:38:05,641 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/safe030_tso.i[945,958] [2022-12-13 09:38:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:38:05,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:38:05,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:38:05,694 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:38:05,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05 WrapperNode [2022-12-13 09:38:05,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:38:05,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:05,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:38:05,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:38:05,701 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:38:05" (1/1) ... [2022-12-13 09:38:05,726 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:38:05" (1/1) ... [2022-12-13 09:38:05,745 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-12-13 09:38:05,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:38:05,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:38:05,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:38:05,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:38:05,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,774 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:38:05,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:38:05,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:38:05,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:38:05,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (1/1) ... [2022-12-13 09:38:05,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:38:05,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:38:05,819 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:38:05,827 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:38:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:38:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:38:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:38:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:38:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:38:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:38:05,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:38:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:38:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:38:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:38:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:38:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:38:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:38:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:38:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:38:05,853 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:38:05,983 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:38:05,985 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:38:06,135 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:38:06,140 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:38:06,141 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:38:06,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:06 BoogieIcfgContainer [2022-12-13 09:38:06,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:38:06,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:38:06,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:38:06,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:38:06,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:38:05" (1/3) ... [2022-12-13 09:38:06,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f2e413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:06, skipping insertion in model container [2022-12-13 09:38:06,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:38:05" (2/3) ... [2022-12-13 09:38:06,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f2e413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:38:06, skipping insertion in model container [2022-12-13 09:38:06,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:38:06" (3/3) ... [2022-12-13 09:38:06,153 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_tso.i [2022-12-13 09:38:06,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:38:06,167 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:38:06,167 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:38:06,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:38:06,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 181 flow [2022-12-13 09:38:06,278 INFO L130 PetriNetUnfolder]: 2/80 cut-off events. [2022-12-13 09:38:06,278 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:06,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-13 09:38:06,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 181 flow [2022-12-13 09:38:06,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 68 transitions, 145 flow [2022-12-13 09:38:06,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:06,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-13 09:38:06,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 68 transitions, 145 flow [2022-12-13 09:38:06,325 INFO L130 PetriNetUnfolder]: 1/68 cut-off events. [2022-12-13 09:38:06,325 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 1/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-13 09:38:06,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-13 09:38:06,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-13 09:38:08,216 INFO L241 LiptonReduction]: Total number of compositions: 51 [2022-12-13 09:38:08,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:38:08,233 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;@1d9dbf8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:38:08,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 09:38:08,237 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 09:38:08,237 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:08,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:08,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:08,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash -957557386, now seen corresponding path program 1 times [2022-12-13 09:38:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:08,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743187430] [2022-12-13 09:38:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:08,549 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:38:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743187430] [2022-12-13 09:38:08,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743187430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:08,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:08,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:38:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668009049] [2022-12-13 09:38:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:08,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 09:38:08,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:08,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:08,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 09:38:08,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:08,706 INFO L130 PetriNetUnfolder]: 1115/1830 cut-off events. [2022-12-13 09:38:08,707 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 09:38:08,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 1830 events. 1115/1830 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9532 event pairs, 595 based on Foata normal form. 118/1616 useless extension candidates. Maximal degree in co-relation 3622. Up to 1114 conditions per place. [2022-12-13 09:38:08,718 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 30 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-13 09:38:08,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 175 flow [2022-12-13 09:38:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 09:38:08,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7160493827160493 [2022-12-13 09:38:08,727 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 58 transitions. [2022-12-13 09:38:08,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 175 flow [2022-12-13 09:38:08,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:38:08,731 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 112 flow [2022-12-13 09:38:08,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2022-12-13 09:38:08,735 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-13 09:38:08,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:08,735 INFO L89 Accepts]: Start accepts. Operand has 37 places, 32 transitions, 112 flow [2022-12-13 09:38:08,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:08,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:08,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 112 flow [2022-12-13 09:38:08,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 112 flow [2022-12-13 09:38:08,751 INFO L130 PetriNetUnfolder]: 90/290 cut-off events. [2022-12-13 09:38:08,751 INFO L131 PetriNetUnfolder]: For 24/30 co-relation queries the response was YES. [2022-12-13 09:38:08,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 290 events. 90/290 cut-off events. For 24/30 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1843 event pairs, 40 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 545. Up to 85 conditions per place. [2022-12-13 09:38:08,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 112 flow [2022-12-13 09:38:08,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 09:38:08,758 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:08,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 09:38:08,759 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 112 flow [2022-12-13 09:38:08,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:08,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:08,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:08,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:38:08,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 380491147, now seen corresponding path program 1 times [2022-12-13 09:38:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:08,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714863421] [2022-12-13 09:38:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:08,848 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:38:08,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:08,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714863421] [2022-12-13 09:38:08,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714863421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:08,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:08,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:08,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821124223] [2022-12-13 09:38:08,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:08,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:08,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:08,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:08,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:08,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:38:08,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:38:08,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:08,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:38:08,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:08,973 INFO L130 PetriNetUnfolder]: 1078/1807 cut-off events. [2022-12-13 09:38:08,973 INFO L131 PetriNetUnfolder]: For 705/705 co-relation queries the response was YES. [2022-12-13 09:38:08,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4753 conditions, 1807 events. 1078/1807 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9594 event pairs, 175 based on Foata normal form. 6/1486 useless extension candidates. Maximal degree in co-relation 4741. Up to 1032 conditions per place. [2022-12-13 09:38:08,982 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 38 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2022-12-13 09:38:08,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 288 flow [2022-12-13 09:38:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 09:38:08,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6730769230769231 [2022-12-13 09:38:08,984 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 112 flow. Second operand 4 states and 70 transitions. [2022-12-13 09:38:08,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 288 flow [2022-12-13 09:38:08,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:08,987 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 182 flow [2022-12-13 09:38:08,988 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-12-13 09:38:08,988 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 09:38:08,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:08,988 INFO L89 Accepts]: Start accepts. Operand has 41 places, 39 transitions, 182 flow [2022-12-13 09:38:08,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:08,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:08,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 39 transitions, 182 flow [2022-12-13 09:38:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 182 flow [2022-12-13 09:38:09,000 INFO L130 PetriNetUnfolder]: 75/255 cut-off events. [2022-12-13 09:38:09,001 INFO L131 PetriNetUnfolder]: For 133/158 co-relation queries the response was YES. [2022-12-13 09:38:09,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 255 events. 75/255 cut-off events. For 133/158 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1522 event pairs, 12 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 582. Up to 78 conditions per place. [2022-12-13 09:38:09,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 182 flow [2022-12-13 09:38:09,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 09:38:09,004 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:09,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 09:38:09,005 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 182 flow [2022-12-13 09:38:09,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:38:09,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:09,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:09,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:38:09,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 380492170, now seen corresponding path program 1 times [2022-12-13 09:38:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:09,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886744083] [2022-12-13 09:38:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:09,134 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:38:09,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:09,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886744083] [2022-12-13 09:38:09,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886744083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:09,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:09,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566868152] [2022-12-13 09:38:09,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:09,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:09,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:09,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:09,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:38:09,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:38:09,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:09,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:38:09,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:09,313 INFO L130 PetriNetUnfolder]: 1049/1755 cut-off events. [2022-12-13 09:38:09,314 INFO L131 PetriNetUnfolder]: For 1323/1323 co-relation queries the response was YES. [2022-12-13 09:38:09,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 1755 events. 1049/1755 cut-off events. For 1323/1323 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9117 event pairs, 258 based on Foata normal form. 5/1437 useless extension candidates. Maximal degree in co-relation 5136. Up to 1038 conditions per place. [2022-12-13 09:38:09,322 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 46 selfloop transitions, 16 changer transitions 0/68 dead transitions. [2022-12-13 09:38:09,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 424 flow [2022-12-13 09:38:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 09:38:09,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2022-12-13 09:38:09,323 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 182 flow. Second operand 4 states and 74 transitions. [2022-12-13 09:38:09,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 424 flow [2022-12-13 09:38:09,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 424 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:09,328 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 324 flow [2022-12-13 09:38:09,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2022-12-13 09:38:09,329 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 09:38:09,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:09,329 INFO L89 Accepts]: Start accepts. Operand has 47 places, 48 transitions, 324 flow [2022-12-13 09:38:09,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:09,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:09,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 48 transitions, 324 flow [2022-12-13 09:38:09,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 48 transitions, 324 flow [2022-12-13 09:38:09,341 INFO L130 PetriNetUnfolder]: 64/229 cut-off events. [2022-12-13 09:38:09,341 INFO L131 PetriNetUnfolder]: For 368/387 co-relation queries the response was YES. [2022-12-13 09:38:09,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 229 events. 64/229 cut-off events. For 368/387 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1308 event pairs, 4 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 682. Up to 72 conditions per place. [2022-12-13 09:38:09,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 48 transitions, 324 flow [2022-12-13 09:38:09,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 09:38:09,344 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:09,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 09:38:09,345 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 324 flow [2022-12-13 09:38:09,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:38:09,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:09,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:09,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:38:09,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1089676267, now seen corresponding path program 1 times [2022-12-13 09:38:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:09,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763967365] [2022-12-13 09:38:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:09,418 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:38:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763967365] [2022-12-13 09:38:09,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763967365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:09,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:09,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611535087] [2022-12-13 09:38:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:09,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:09,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:38:09,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:09,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:09,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:38:09,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:09,554 INFO L130 PetriNetUnfolder]: 1028/1722 cut-off events. [2022-12-13 09:38:09,554 INFO L131 PetriNetUnfolder]: For 3229/3229 co-relation queries the response was YES. [2022-12-13 09:38:09,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5981 conditions, 1722 events. 1028/1722 cut-off events. For 3229/3229 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9029 event pairs, 251 based on Foata normal form. 4/1406 useless extension candidates. Maximal degree in co-relation 5961. Up to 1035 conditions per place. [2022-12-13 09:38:09,564 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 46 selfloop transitions, 22 changer transitions 0/74 dead transitions. [2022-12-13 09:38:09,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 592 flow [2022-12-13 09:38:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:38:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:38:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 09:38:09,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 09:38:09,569 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 324 flow. Second operand 4 states and 72 transitions. [2022-12-13 09:38:09,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 592 flow [2022-12-13 09:38:09,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 592 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:09,577 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 502 flow [2022-12-13 09:38:09,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2022-12-13 09:38:09,579 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2022-12-13 09:38:09,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:09,579 INFO L89 Accepts]: Start accepts. Operand has 53 places, 56 transitions, 502 flow [2022-12-13 09:38:09,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:09,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:09,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 56 transitions, 502 flow [2022-12-13 09:38:09,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 56 transitions, 502 flow [2022-12-13 09:38:09,593 INFO L130 PetriNetUnfolder]: 57/212 cut-off events. [2022-12-13 09:38:09,594 INFO L131 PetriNetUnfolder]: For 699/769 co-relation queries the response was YES. [2022-12-13 09:38:09,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 212 events. 57/212 cut-off events. For 699/769 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1203 event pairs, 3 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 777. Up to 67 conditions per place. [2022-12-13 09:38:09,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 56 transitions, 502 flow [2022-12-13 09:38:09,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 618 [2022-12-13 09:38:09,598 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:09,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 09:38:09,599 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 502 flow [2022-12-13 09:38:09,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:09,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:09,599 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:38:09,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1912666581, now seen corresponding path program 1 times [2022-12-13 09:38:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:09,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940816606] [2022-12-13 09:38:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:09,677 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:38:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:09,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940816606] [2022-12-13 09:38:09,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940816606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:09,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:09,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347403633] [2022-12-13 09:38:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:09,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:09,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 26 [2022-12-13 09:38:09,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:09,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:09,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 26 [2022-12-13 09:38:09,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:09,817 INFO L130 PetriNetUnfolder]: 1029/1943 cut-off events. [2022-12-13 09:38:09,817 INFO L131 PetriNetUnfolder]: For 6783/6828 co-relation queries the response was YES. [2022-12-13 09:38:09,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1943 events. 1029/1943 cut-off events. For 6783/6828 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12578 event pairs, 446 based on Foata normal form. 53/1543 useless extension candidates. Maximal degree in co-relation 6969. Up to 912 conditions per place. [2022-12-13 09:38:09,830 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 41 selfloop transitions, 8 changer transitions 2/68 dead transitions. [2022-12-13 09:38:09,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 644 flow [2022-12-13 09:38:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 09:38:09,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 09:38:09,832 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 502 flow. Second operand 3 states and 56 transitions. [2022-12-13 09:38:09,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 644 flow [2022-12-13 09:38:09,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 644 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:38:09,841 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 506 flow [2022-12-13 09:38:09,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-13 09:38:09,842 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-13 09:38:09,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:09,842 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 506 flow [2022-12-13 09:38:09,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:09,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:09,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 506 flow [2022-12-13 09:38:09,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 506 flow [2022-12-13 09:38:09,854 INFO L130 PetriNetUnfolder]: 51/227 cut-off events. [2022-12-13 09:38:09,855 INFO L131 PetriNetUnfolder]: For 848/924 co-relation queries the response was YES. [2022-12-13 09:38:09,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 227 events. 51/227 cut-off events. For 848/924 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1402 event pairs, 2 based on Foata normal form. 2/159 useless extension candidates. Maximal degree in co-relation 823. Up to 70 conditions per place. [2022-12-13 09:38:09,856 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 506 flow [2022-12-13 09:38:09,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-13 09:38:09,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:09,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 09:38:09,858 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 506 flow [2022-12-13 09:38:09,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:09,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:09,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:09,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:38:09,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1935339454, now seen corresponding path program 1 times [2022-12-13 09:38:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:09,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301029468] [2022-12-13 09:38:09,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:09,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:09,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:38:09,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:09,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301029468] [2022-12-13 09:38:09,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301029468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:09,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:09,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:09,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089415202] [2022-12-13 09:38:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:09,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:38:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:38:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:38:09,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:38:09,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:09,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:09,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:38:09,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:10,159 INFO L130 PetriNetUnfolder]: 2029/3500 cut-off events. [2022-12-13 09:38:10,159 INFO L131 PetriNetUnfolder]: For 14341/14478 co-relation queries the response was YES. [2022-12-13 09:38:10,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11183 conditions, 3500 events. 2029/3500 cut-off events. For 14341/14478 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 24465 event pairs, 473 based on Foata normal form. 188/2052 useless extension candidates. Maximal degree in co-relation 11156. Up to 2275 conditions per place. [2022-12-13 09:38:10,175 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 79 selfloop transitions, 20 changer transitions 16/134 dead transitions. [2022-12-13 09:38:10,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 134 transitions, 1403 flow [2022-12-13 09:38:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 09:38:10,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7153846153846154 [2022-12-13 09:38:10,177 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 506 flow. Second operand 5 states and 93 transitions. [2022-12-13 09:38:10,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 134 transitions, 1403 flow [2022-12-13 09:38:10,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 134 transitions, 1378 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 09:38:10,189 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 646 flow [2022-12-13 09:38:10,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=646, PETRI_PLACES=62, PETRI_TRANSITIONS=73} [2022-12-13 09:38:10,191 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-13 09:38:10,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:10,191 INFO L89 Accepts]: Start accepts. Operand has 62 places, 73 transitions, 646 flow [2022-12-13 09:38:10,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:10,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:10,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 73 transitions, 646 flow [2022-12-13 09:38:10,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 73 transitions, 646 flow [2022-12-13 09:38:10,320 INFO L130 PetriNetUnfolder]: 1129/2165 cut-off events. [2022-12-13 09:38:10,320 INFO L131 PetriNetUnfolder]: For 3747/4646 co-relation queries the response was YES. [2022-12-13 09:38:10,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7229 conditions, 2165 events. 1129/2165 cut-off events. For 3747/4646 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 17154 event pairs, 416 based on Foata normal form. 18/946 useless extension candidates. Maximal degree in co-relation 7201. Up to 1853 conditions per place. [2022-12-13 09:38:10,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 73 transitions, 646 flow [2022-12-13 09:38:10,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 976 [2022-12-13 09:38:10,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [243] L725-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_191 (+ v_~__unbuffered_cnt~0_192 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_192} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 09:38:10,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [223] L740-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_13|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P1Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 09:38:10,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [187] L755-->L760: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:38:10,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [227] L755-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 09:38:10,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [249] L755-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_209 (+ v_~__unbuffered_cnt~0_210 1)) (= |v_P2Thread1of1ForFork0_#res.base_19| 0) (= |v_P2Thread1of1ForFork0_#res.offset_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_210} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_209, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_19|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 09:38:10,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [175] L725-->L730: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:38:10,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [181] L740-->L745: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 09:38:10,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [242] L725-->P0FINAL: Formula: (and (= v_~__unbuffered_cnt~0_187 (+ v_~__unbuffered_cnt~0_188 1)) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_188} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 09:38:10,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_35|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [222] L740-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 09:38:10,676 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:38:10,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 487 [2022-12-13 09:38:10,678 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 646 flow [2022-12-13 09:38:10,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:10,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:10,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:10,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:38:10,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash 115327085, now seen corresponding path program 1 times [2022-12-13 09:38:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:10,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953532014] [2022-12-13 09:38:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:10,734 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:38:10,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953532014] [2022-12-13 09:38:10,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953532014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:10,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:10,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363663936] [2022-12-13 09:38:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:10,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:10,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:10,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:38:10,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:10,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:10,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:38:10,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:11,049 INFO L130 PetriNetUnfolder]: 2636/4676 cut-off events. [2022-12-13 09:38:11,049 INFO L131 PetriNetUnfolder]: For 14910/15339 co-relation queries the response was YES. [2022-12-13 09:38:11,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20303 conditions, 4676 events. 2636/4676 cut-off events. For 14910/15339 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 35521 event pairs, 687 based on Foata normal form. 66/3458 useless extension candidates. Maximal degree in co-relation 20272. Up to 3731 conditions per place. [2022-12-13 09:38:11,074 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 55 selfloop transitions, 7 changer transitions 10/91 dead transitions. [2022-12-13 09:38:11,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 940 flow [2022-12-13 09:38:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 09:38:11,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-13 09:38:11,075 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 646 flow. Second operand 3 states and 66 transitions. [2022-12-13 09:38:11,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 940 flow [2022-12-13 09:38:11,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 900 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 09:38:11,093 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 625 flow [2022-12-13 09:38:11,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2022-12-13 09:38:11,094 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2022-12-13 09:38:11,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:11,096 INFO L89 Accepts]: Start accepts. Operand has 63 places, 67 transitions, 625 flow [2022-12-13 09:38:11,097 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:11,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:11,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 67 transitions, 625 flow [2022-12-13 09:38:11,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 67 transitions, 625 flow [2022-12-13 09:38:11,265 INFO L130 PetriNetUnfolder]: 1689/3179 cut-off events. [2022-12-13 09:38:11,266 INFO L131 PetriNetUnfolder]: For 4454/5777 co-relation queries the response was YES. [2022-12-13 09:38:11,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10183 conditions, 3179 events. 1689/3179 cut-off events. For 4454/5777 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 26800 event pairs, 750 based on Foata normal form. 10/1312 useless extension candidates. Maximal degree in co-relation 10154. Up to 2944 conditions per place. [2022-12-13 09:38:11,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 67 transitions, 625 flow [2022-12-13 09:38:11,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 804 [2022-12-13 09:38:11,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:11,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-13 09:38:11,345 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 601 flow [2022-12-13 09:38:11,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:11,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:11,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:11,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:38:11,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 940111876, now seen corresponding path program 1 times [2022-12-13 09:38:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:11,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669268015] [2022-12-13 09:38:11,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:11,427 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:38:11,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:11,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669268015] [2022-12-13 09:38:11,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669268015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:11,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:11,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:38:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15002622] [2022-12-13 09:38:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:11,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:38:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:38:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:38:11,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 09:38:11,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:11,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:11,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 09:38:11,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:11,785 INFO L130 PetriNetUnfolder]: 3288/5844 cut-off events. [2022-12-13 09:38:11,786 INFO L131 PetriNetUnfolder]: For 15923/16452 co-relation queries the response was YES. [2022-12-13 09:38:11,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24497 conditions, 5844 events. 3288/5844 cut-off events. For 15923/16452 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 47294 event pairs, 1045 based on Foata normal form. 80/4233 useless extension candidates. Maximal degree in co-relation 24465. Up to 4876 conditions per place. [2022-12-13 09:38:11,812 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 49 selfloop transitions, 7 changer transitions 8/81 dead transitions. [2022-12-13 09:38:11,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 833 flow [2022-12-13 09:38:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:38:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:38:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 09:38:11,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:38:11,813 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 601 flow. Second operand 3 states and 58 transitions. [2022-12-13 09:38:11,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 833 flow [2022-12-13 09:38:11,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 824 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 09:38:11,835 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 591 flow [2022-12-13 09:38:11,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2022-12-13 09:38:11,837 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-13 09:38:11,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:11,837 INFO L89 Accepts]: Start accepts. Operand has 65 places, 62 transitions, 591 flow [2022-12-13 09:38:11,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:11,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:11,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 62 transitions, 591 flow [2022-12-13 09:38:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 62 transitions, 591 flow [2022-12-13 09:38:12,006 INFO L130 PetriNetUnfolder]: 2248/4212 cut-off events. [2022-12-13 09:38:12,006 INFO L131 PetriNetUnfolder]: For 4911/7011 co-relation queries the response was YES. [2022-12-13 09:38:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13107 conditions, 4212 events. 2248/4212 cut-off events. For 4911/7011 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 37777 event pairs, 1209 based on Foata normal form. 11/1703 useless extension candidates. Maximal degree in co-relation 13077. Up to 3991 conditions per place. [2022-12-13 09:38:12,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 62 transitions, 591 flow [2022-12-13 09:38:12,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 09:38:12,066 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:12,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-13 09:38:12,067 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 567 flow [2022-12-13 09:38:12,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:38:12,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:12,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:12,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:38:12,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:12,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash -572910435, now seen corresponding path program 1 times [2022-12-13 09:38:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:12,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298032215] [2022-12-13 09:38:12,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:38:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298032215] [2022-12-13 09:38:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298032215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:12,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104479018] [2022-12-13 09:38:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:12,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:12,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:12,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 09:38:12,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:38:12,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:12,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 09:38:12,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:12,476 INFO L130 PetriNetUnfolder]: 2448/4575 cut-off events. [2022-12-13 09:38:12,476 INFO L131 PetriNetUnfolder]: For 16229/16813 co-relation queries the response was YES. [2022-12-13 09:38:12,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19823 conditions, 4575 events. 2448/4575 cut-off events. For 16229/16813 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 38739 event pairs, 204 based on Foata normal form. 179/2453 useless extension candidates. Maximal degree in co-relation 19790. Up to 3979 conditions per place. [2022-12-13 09:38:12,494 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 40 selfloop transitions, 19 changer transitions 58/129 dead transitions. [2022-12-13 09:38:12,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 1483 flow [2022-12-13 09:38:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:38:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:38:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 09:38:12,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7243589743589743 [2022-12-13 09:38:12,496 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 567 flow. Second operand 6 states and 113 transitions. [2022-12-13 09:38:12,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 1483 flow [2022-12-13 09:38:12,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 129 transitions, 1460 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 09:38:12,531 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 594 flow [2022-12-13 09:38:12,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2022-12-13 09:38:12,532 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2022-12-13 09:38:12,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:38:12,532 INFO L89 Accepts]: Start accepts. Operand has 70 places, 56 transitions, 594 flow [2022-12-13 09:38:12,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:38:12,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:12,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 56 transitions, 594 flow [2022-12-13 09:38:12,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 56 transitions, 594 flow [2022-12-13 09:38:12,578 INFO L130 PetriNetUnfolder]: 486/999 cut-off events. [2022-12-13 09:38:12,578 INFO L131 PetriNetUnfolder]: For 3334/4734 co-relation queries the response was YES. [2022-12-13 09:38:12,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4941 conditions, 999 events. 486/999 cut-off events. For 3334/4734 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 7116 event pairs, 81 based on Foata normal form. 5/455 useless extension candidates. Maximal degree in co-relation 4908. Up to 919 conditions per place. [2022-12-13 09:38:12,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 56 transitions, 594 flow [2022-12-13 09:38:12,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 09:38:12,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:38:12,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 09:38:12,701 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 592 flow [2022-12-13 09:38:12,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:38:12,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:38:12,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:12,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:38:12,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 09:38:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:38:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -375826977, now seen corresponding path program 1 times [2022-12-13 09:38:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:38:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906231661] [2022-12-13 09:38:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:38:12,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:38:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:38:12,786 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:38:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:38:12,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906231661] [2022-12-13 09:38:12,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906231661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:38:12,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:38:12,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:38:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137263024] [2022-12-13 09:38:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:38:12,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:38:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:38:12,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:38:12,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:38:12,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 09:38:12,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 592 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:38:12,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:38:12,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 09:38:12,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:38:12,886 INFO L130 PetriNetUnfolder]: 404/736 cut-off events. [2022-12-13 09:38:12,887 INFO L131 PetriNetUnfolder]: For 3835/4206 co-relation queries the response was YES. [2022-12-13 09:38:12,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 736 events. 404/736 cut-off events. For 3835/4206 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 4110 event pairs, 8 based on Foata normal form. 67/387 useless extension candidates. Maximal degree in co-relation 4320. Up to 580 conditions per place. [2022-12-13 09:38:12,889 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 0 selfloop transitions, 0 changer transitions 69/69 dead transitions. [2022-12-13 09:38:12,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 854 flow [2022-12-13 09:38:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:38:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:38:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 09:38:12,890 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.632 [2022-12-13 09:38:12,890 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 592 flow. Second operand 5 states and 79 transitions. [2022-12-13 09:38:12,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 854 flow [2022-12-13 09:38:12,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 698 flow, removed 36 selfloop flow, removed 11 redundant places. [2022-12-13 09:38:12,906 INFO L231 Difference]: Finished difference. Result has 59 places, 0 transitions, 0 flow [2022-12-13 09:38:12,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=59, PETRI_TRANSITIONS=0} [2022-12-13 09:38:12,908 INFO L295 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-13 09:38:12,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:38:12,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 0 transitions, 0 flow [2022-12-13 09:38:12,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 09:38:12,908 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 09:38:12,909 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:38:12,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 09:38:12,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 09:38:12,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 09:38:12,909 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:38:12,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 09:38:12,910 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 09:38:12,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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:38:12,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 09:38:12,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 09:38:12,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 09:38:12,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 09:38:12,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:38:12,913 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:38:12,930 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:38:12,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:38:12,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:38:12 BasicIcfg [2022-12-13 09:38:12,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:38:12,933 INFO L158 Benchmark]: Toolchain (without parser) took 7615.11ms. Allocated memory was 180.4MB in the beginning and 464.5MB in the end (delta: 284.2MB). Free memory was 154.8MB in the beginning and 376.6MB in the end (delta: -221.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2022-12-13 09:38:12,933 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:38:12,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.49ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 131.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:12,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.13ms. Allocated memory is still 180.4MB. Free memory was 131.1MB in the beginning and 129.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:38:12,933 INFO L158 Benchmark]: Boogie Preprocessor took 30.89ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 127.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 09:38:12,934 INFO L158 Benchmark]: RCFGBuilder took 366.70ms. Allocated memory is still 180.4MB. Free memory was 127.5MB in the beginning and 113.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-13 09:38:12,934 INFO L158 Benchmark]: TraceAbstraction took 6786.53ms. Allocated memory was 180.4MB in the beginning and 464.5MB in the end (delta: 284.2MB). Free memory was 112.9MB in the beginning and 376.6MB in the end (delta: -263.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 09:38:12,935 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 376.49ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 131.1MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.13ms. Allocated memory is still 180.4MB. Free memory was 131.1MB in the beginning and 129.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.89ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 127.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 366.70ms. Allocated memory is still 180.4MB. Free memory was 127.5MB in the beginning and 113.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6786.53ms. Allocated memory was 180.4MB in the beginning and 464.5MB in the end (delta: 284.2MB). Free memory was 112.9MB in the beginning and 376.6MB in the end (delta: -263.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 77 PlacesBefore, 36 PlacesAfterwards, 68 TransitionsBefore, 27 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1084, independent: 1028, independent conditional: 1028, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 859, independent: 816, independent conditional: 0, independent unconditional: 816, 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: 859, independent: 816, independent conditional: 0, independent unconditional: 816, 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: 859, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1084, independent: 212, independent conditional: 212, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 859, unknown conditional: 859, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 816, Positive conditional cache size: 816, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 8, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 41 PlacesBefore, 41 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 9, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 47 PlacesBefore, 47 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 4, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 18, Positive conditional cache size: 18, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 53 PlacesBefore, 53 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 3, independent: 3, independent conditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 21, Positive conditional cache size: 21, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 56 PlacesBefore, 56 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 62 PlacesBefore, 61 PlacesAfterwards, 73 TransitionsBefore, 69 TransitionsAfterwards, 976 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 375, independent conditional: 375, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, independent unconditional: 0, 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: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 0, independent unconditional: 79, 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: 375, independent: 296, independent conditional: 296, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 79, unknown conditional: 79, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 101, Positive conditional cache size: 101, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 63 PlacesBefore, 63 PlacesAfterwards, 67 TransitionsBefore, 64 TransitionsAfterwards, 804 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, 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: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 143, Positive conditional cache size: 143, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 65 PlacesBefore, 64 PlacesAfterwards, 62 TransitionsBefore, 59 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, 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: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 0, independent unconditional: 39, 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: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 182, Positive conditional cache size: 182, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 68 PlacesBefore, 67 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 191, Positive conditional cache size: 191, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 191, Positive conditional cache size: 191, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 106 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 21 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=646occurred in iteration=6, InterpolantAutomatonStates: 40, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 09:38:12,969 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...