/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:59,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:59,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:59,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:59,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:59,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:59,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:59,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:59,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:59,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:59,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:59,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:59,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:59,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:59,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:59,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:59,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:59,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:59,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:59,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:59,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:59,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:59,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:59,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:59,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:59,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:59,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:59,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:59,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:59,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:59,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:59,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:59,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:59,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:59,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:59,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:59,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:59,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:59,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:59,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:59,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:59,588 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:18:59,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:59,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:59,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:59,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:59,616 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:59,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:59,616 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:59,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:59,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:59,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:59,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:59,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:59,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:59,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:59,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:59,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:59,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:59,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:59,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:59,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:59,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:59,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:59,620 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-06 06:18:59,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:59,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:59,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:59,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:59,995 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:59,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-06 06:19:01,107 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:19:01,400 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:19:01,400 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-06 06:19:01,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb8b3796/10ac4ce41fac4f73a10cff9d3c29190a/FLAG66a30c92e [2022-12-06 06:19:01,451 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb8b3796/10ac4ce41fac4f73a10cff9d3c29190a [2022-12-06 06:19:01,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:19:01,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:19:01,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:19:01,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:19:01,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:19:01,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d28dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:01, skipping insertion in model container [2022-12-06 06:19:01,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:01" (1/1) ... [2022-12-06 06:19:01,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:19:01,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:19:01,697 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/mix016_pso.opt_tso.opt.i[956,969] [2022-12-06 06:19:01,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:19:01,945 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:19:01,957 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/mix016_pso.opt_tso.opt.i[956,969] [2022-12-06 06:19:01,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:01,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:01,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:02,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:02,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:19:02,046 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:19:02,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02 WrapperNode [2022-12-06 06:19:02,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:19:02,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:19:02,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:19:02,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:19:02,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,099 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-12-06 06:19:02,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:19:02,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:19:02,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:19:02,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:19:02,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,128 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:19:02,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:19:02,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:19:02,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:19:02,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (1/1) ... [2022-12-06 06:19:02,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:19:02,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:19:02,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:19:02,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:19:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:19:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:19:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:19:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:19:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:19:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:19:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:19:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:19:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:19:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:19:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:19:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:19:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:19:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:19:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:19:02,205 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:19:02,384 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:19:02,386 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:19:02,692 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:19:02,813 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:19:02,814 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:19:02,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:02 BoogieIcfgContainer [2022-12-06 06:19:02,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:19:02,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:19:02,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:19:02,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:19:02,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:19:01" (1/3) ... [2022-12-06 06:19:02,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbba65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:02, skipping insertion in model container [2022-12-06 06:19:02,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:02" (2/3) ... [2022-12-06 06:19:02,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbba65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:02, skipping insertion in model container [2022-12-06 06:19:02,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:02" (3/3) ... [2022-12-06 06:19:02,824 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2022-12-06 06:19:02,840 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:19:02,841 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:19:02,841 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:19:02,923 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:19:02,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:19:03,031 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:19:03,031 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:03,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:19:03,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-06 06:19:03,043 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-06 06:19:03,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:03,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:19:03,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-06 06:19:03,115 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-06 06:19:03,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:03,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:19:03,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-06 06:19:03,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 06:19:07,681 INFO L203 LiptonReduction]: Total number of compositions: 84 [2022-12-06 06:19:07,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:19:07,708 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;@5918db60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:19:07,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:19:07,712 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 06:19:07,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:07,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:07,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:07,714 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:07,719 INFO L85 PathProgramCache]: Analyzing trace with hash -153082450, now seen corresponding path program 1 times [2022-12-06 06:19:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:07,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46536402] [2022-12-06 06:19:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:07,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:08,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46536402] [2022-12-06 06:19:08,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46536402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:08,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:08,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:19:08,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18184702] [2022-12-06 06:19:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:08,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:19:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:08,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:19:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:19:08,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:19:08,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:08,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:19:08,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:08,527 INFO L130 PetriNetUnfolder]: 777/1241 cut-off events. [2022-12-06 06:19:08,527 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:19:08,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 1241 events. 777/1241 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5834 event pairs, 129 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 2435. Up to 937 conditions per place. [2022-12-06 06:19:08,544 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 24 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 06:19:08,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-12-06 06:19:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:19:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:19:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 06:19:08,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 06:19:08,557 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 41 transitions. [2022-12-06 06:19:08,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-12-06 06:19:08,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:08,561 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 06:19:08,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 06:19:08,566 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:19:08,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:08,567 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 06:19:08,569 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:08,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:08,570 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 06:19:08,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:19:08,583 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:19:08,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:08,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:19:08,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:19:08,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 06:19:08,689 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:08,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 06:19:08,691 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:19:08,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:08,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:08,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:19:08,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:08,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1083264351, now seen corresponding path program 1 times [2022-12-06 06:19:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:08,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590777748] [2022-12-06 06:19:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:08,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:08,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590777748] [2022-12-06 06:19:08,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590777748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:08,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:08,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:19:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857442800] [2022-12-06 06:19:08,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:08,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:19:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:08,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:19:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:19:08,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:19:08,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:08,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:08,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:19:08,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:09,075 INFO L130 PetriNetUnfolder]: 831/1248 cut-off events. [2022-12-06 06:19:09,076 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 06:19:09,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 1248 events. 831/1248 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4827 event pairs, 295 based on Foata normal form. 8/1256 useless extension candidates. Maximal degree in co-relation 2592. Up to 1173 conditions per place. [2022-12-06 06:19:09,084 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2022-12-06 06:19:09,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 144 flow [2022-12-06 06:19:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:19:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:19:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:19:09,087 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:19:09,087 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:19:09,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 144 flow [2022-12-06 06:19:09,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:09,089 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 72 flow [2022-12-06 06:19:09,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-06 06:19:09,090 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-06 06:19:09,090 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:09,090 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 72 flow [2022-12-06 06:19:09,090 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:09,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:09,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 72 flow [2022-12-06 06:19:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 72 flow [2022-12-06 06:19:09,099 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-06 06:19:09,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:09,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 62 events. 14/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 180 event pairs, 6 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 95. Up to 29 conditions per place. [2022-12-06 06:19:09,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 72 flow [2022-12-06 06:19:09,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 06:19:09,135 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:09,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 06:19:09,137 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 72 flow [2022-12-06 06:19:09,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:09,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:09,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:09,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:19:09,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -61415030, now seen corresponding path program 1 times [2022-12-06 06:19:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:09,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298981415] [2022-12-06 06:19:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:09,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:09,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298981415] [2022-12-06 06:19:09,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298981415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:09,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:09,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:19:09,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449151269] [2022-12-06 06:19:09,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:09,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:09,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:09,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:19:09,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 72 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:09,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:09,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:19:09,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:09,497 INFO L130 PetriNetUnfolder]: 775/1168 cut-off events. [2022-12-06 06:19:09,497 INFO L131 PetriNetUnfolder]: For 207/207 co-relation queries the response was YES. [2022-12-06 06:19:09,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1168 events. 775/1168 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4329 event pairs, 247 based on Foata normal form. 24/1192 useless extension candidates. Maximal degree in co-relation 2724. Up to 817 conditions per place. [2022-12-06 06:19:09,505 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-06 06:19:09,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 154 flow [2022-12-06 06:19:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:19:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:19:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 06:19:09,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-06 06:19:09,506 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 72 flow. Second operand 3 states and 29 transitions. [2022-12-06 06:19:09,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 154 flow [2022-12-06 06:19:09,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:19:09,508 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 79 flow [2022-12-06 06:19:09,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2022-12-06 06:19:09,510 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-06 06:19:09,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:09,510 INFO L89 Accepts]: Start accepts. Operand has 32 places, 23 transitions, 79 flow [2022-12-06 06:19:09,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:09,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:09,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 79 flow [2022-12-06 06:19:09,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 79 flow [2022-12-06 06:19:09,521 INFO L130 PetriNetUnfolder]: 9/44 cut-off events. [2022-12-06 06:19:09,521 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 06:19:09,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 44 events. 9/44 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 2 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 78. Up to 21 conditions per place. [2022-12-06 06:19:09,522 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 79 flow [2022-12-06 06:19:09,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 198 [2022-12-06 06:19:09,524 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:09,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 06:19:09,526 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 79 flow [2022-12-06 06:19:09,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:09,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:09,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:09,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:19:09,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1636862449, now seen corresponding path program 1 times [2022-12-06 06:19:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:09,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099365440] [2022-12-06 06:19:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:09,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099365440] [2022-12-06 06:19:09,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099365440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:09,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:09,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922069882] [2022-12-06 06:19:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:09,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:09,779 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 06:19:09,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:09,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:09,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 06:19:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:09,983 INFO L130 PetriNetUnfolder]: 434/749 cut-off events. [2022-12-06 06:19:09,983 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-06 06:19:09,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 749 events. 434/749 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3364 event pairs, 78 based on Foata normal form. 76/823 useless extension candidates. Maximal degree in co-relation 1787. Up to 440 conditions per place. [2022-12-06 06:19:09,988 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 45 selfloop transitions, 7 changer transitions 2/57 dead transitions. [2022-12-06 06:19:09,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 57 transitions, 287 flow [2022-12-06 06:19:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-06 06:19:09,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 06:19:09,992 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 79 flow. Second operand 5 states and 62 transitions. [2022-12-06 06:19:09,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 57 transitions, 287 flow [2022-12-06 06:19:09,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:09,998 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 127 flow [2022-12-06 06:19:09,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-06 06:19:10,000 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-06 06:19:10,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:10,000 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 127 flow [2022-12-06 06:19:10,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:10,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:10,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 127 flow [2022-12-06 06:19:10,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 127 flow [2022-12-06 06:19:10,018 INFO L130 PetriNetUnfolder]: 52/140 cut-off events. [2022-12-06 06:19:10,018 INFO L131 PetriNetUnfolder]: For 76/95 co-relation queries the response was YES. [2022-12-06 06:19:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 140 events. 52/140 cut-off events. For 76/95 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 621 event pairs, 21 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 363. Up to 74 conditions per place. [2022-12-06 06:19:10,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 127 flow [2022-12-06 06:19:10,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-06 06:19:10,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L848-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [456] L826-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.offset_17| 0) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= |v_P2Thread1of1ForFork0_#res#1.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-06 06:19:10,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L848-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_93) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [437] L779-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 06:19:10,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:10,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 06:19:10,106 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 129 flow [2022-12-06 06:19:10,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:10,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:10,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:10,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:19:10,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash 552057299, now seen corresponding path program 1 times [2022-12-06 06:19:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:10,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278865554] [2022-12-06 06:19:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278865554] [2022-12-06 06:19:10,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278865554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:10,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:10,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:10,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152223206] [2022-12-06 06:19:10,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:10,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:10,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:10,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:10,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 06:19:10,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:10,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:10,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 06:19:10,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:10,470 INFO L130 PetriNetUnfolder]: 248/476 cut-off events. [2022-12-06 06:19:10,470 INFO L131 PetriNetUnfolder]: For 374/374 co-relation queries the response was YES. [2022-12-06 06:19:10,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 476 events. 248/476 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2042 event pairs, 45 based on Foata normal form. 44/518 useless extension candidates. Maximal degree in co-relation 1486. Up to 188 conditions per place. [2022-12-06 06:19:10,473 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 44 selfloop transitions, 12 changer transitions 9/68 dead transitions. [2022-12-06 06:19:10,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 403 flow [2022-12-06 06:19:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-06 06:19:10,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:19:10,482 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 129 flow. Second operand 6 states and 77 transitions. [2022-12-06 06:19:10,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 403 flow [2022-12-06 06:19:10,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 395 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 06:19:10,487 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 207 flow [2022-12-06 06:19:10,487 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 06:19:10,489 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2022-12-06 06:19:10,489 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:10,489 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 207 flow [2022-12-06 06:19:10,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:10,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:10,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 207 flow [2022-12-06 06:19:10,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 207 flow [2022-12-06 06:19:10,503 INFO L130 PetriNetUnfolder]: 24/99 cut-off events. [2022-12-06 06:19:10,504 INFO L131 PetriNetUnfolder]: For 236/250 co-relation queries the response was YES. [2022-12-06 06:19:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 99 events. 24/99 cut-off events. For 236/250 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 387 event pairs, 4 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 349. Up to 60 conditions per place. [2022-12-06 06:19:10,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 207 flow [2022-12-06 06:19:10,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 06:19:10,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:10,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 06:19:10,553 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 199 flow [2022-12-06 06:19:10,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:10,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:10,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:10,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:19:10,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash -371920710, now seen corresponding path program 1 times [2022-12-06 06:19:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:10,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877816010] [2022-12-06 06:19:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:10,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877816010] [2022-12-06 06:19:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877816010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:10,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:10,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148181670] [2022-12-06 06:19:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:10,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:10,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:19:10,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:10,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:10,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:19:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:10,935 INFO L130 PetriNetUnfolder]: 282/539 cut-off events. [2022-12-06 06:19:10,936 INFO L131 PetriNetUnfolder]: For 1093/1093 co-relation queries the response was YES. [2022-12-06 06:19:10,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 539 events. 282/539 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2357 event pairs, 39 based on Foata normal form. 6/545 useless extension candidates. Maximal degree in co-relation 1922. Up to 298 conditions per place. [2022-12-06 06:19:10,941 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 42 selfloop transitions, 2 changer transitions 26/71 dead transitions. [2022-12-06 06:19:10,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 585 flow [2022-12-06 06:19:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:19:10,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2022-12-06 06:19:10,942 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 199 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:19:10,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 585 flow [2022-12-06 06:19:10,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 513 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:10,947 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 156 flow [2022-12-06 06:19:10,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-12-06 06:19:10,948 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-06 06:19:10,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:10,948 INFO L89 Accepts]: Start accepts. Operand has 46 places, 30 transitions, 156 flow [2022-12-06 06:19:10,949 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:10,949 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:10,949 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 156 flow [2022-12-06 06:19:10,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 156 flow [2022-12-06 06:19:10,961 INFO L130 PetriNetUnfolder]: 31/108 cut-off events. [2022-12-06 06:19:10,961 INFO L131 PetriNetUnfolder]: For 160/164 co-relation queries the response was YES. [2022-12-06 06:19:10,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 108 events. 31/108 cut-off events. For 160/164 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 402 event pairs, 7 based on Foata normal form. 3/108 useless extension candidates. Maximal degree in co-relation 337. Up to 42 conditions per place. [2022-12-06 06:19:10,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 156 flow [2022-12-06 06:19:10,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:19:11,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:11,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 06:19:11,168 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 159 flow [2022-12-06 06:19:11,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:11,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:11,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:11,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:19:11,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1369532472, now seen corresponding path program 2 times [2022-12-06 06:19:11,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:11,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374274229] [2022-12-06 06:19:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:11,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:11,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374274229] [2022-12-06 06:19:11,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374274229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:11,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:11,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:19:11,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393810071] [2022-12-06 06:19:11,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:11,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:11,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:11,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:11,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:11,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:19:11,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:11,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:11,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:19:11,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:11,492 INFO L130 PetriNetUnfolder]: 180/355 cut-off events. [2022-12-06 06:19:11,493 INFO L131 PetriNetUnfolder]: For 465/479 co-relation queries the response was YES. [2022-12-06 06:19:11,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 355 events. 180/355 cut-off events. For 465/479 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1471 event pairs, 46 based on Foata normal form. 27/371 useless extension candidates. Maximal degree in co-relation 1162. Up to 128 conditions per place. [2022-12-06 06:19:11,495 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 32 selfloop transitions, 10 changer transitions 13/58 dead transitions. [2022-12-06 06:19:11,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 377 flow [2022-12-06 06:19:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:19:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:19:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-12-06 06:19:11,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2022-12-06 06:19:11,496 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 159 flow. Second operand 7 states and 69 transitions. [2022-12-06 06:19:11,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 377 flow [2022-12-06 06:19:11,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 342 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-06 06:19:11,499 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 156 flow [2022-12-06 06:19:11,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2022-12-06 06:19:11,500 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-06 06:19:11,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:11,500 INFO L89 Accepts]: Start accepts. Operand has 48 places, 28 transitions, 156 flow [2022-12-06 06:19:11,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:11,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:11,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 28 transitions, 156 flow [2022-12-06 06:19:11,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 28 transitions, 156 flow [2022-12-06 06:19:11,509 INFO L130 PetriNetUnfolder]: 9/44 cut-off events. [2022-12-06 06:19:11,509 INFO L131 PetriNetUnfolder]: For 44/45 co-relation queries the response was YES. [2022-12-06 06:19:11,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 44 events. 9/44 cut-off events. For 44/45 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 1 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 130. Up to 13 conditions per place. [2022-12-06 06:19:11,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 28 transitions, 156 flow [2022-12-06 06:19:11,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-06 06:19:12,336 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:12,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 838 [2022-12-06 06:19:12,339 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 150 flow [2022-12-06 06:19:12,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:12,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:12,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:12,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:19:12,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -580402941, now seen corresponding path program 1 times [2022-12-06 06:19:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206618689] [2022-12-06 06:19:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:12,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206618689] [2022-12-06 06:19:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206618689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:12,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970111947] [2022-12-06 06:19:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:12,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:12,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:12,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:19:12,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:12,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:12,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:19:12,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:12,621 INFO L130 PetriNetUnfolder]: 102/219 cut-off events. [2022-12-06 06:19:12,621 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2022-12-06 06:19:12,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 219 events. 102/219 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 801 event pairs, 18 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 815. Up to 130 conditions per place. [2022-12-06 06:19:12,623 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 23 selfloop transitions, 1 changer transitions 24/49 dead transitions. [2022-12-06 06:19:12,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 387 flow [2022-12-06 06:19:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 06:19:12,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2022-12-06 06:19:12,625 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 150 flow. Second operand 4 states and 37 transitions. [2022-12-06 06:19:12,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 387 flow [2022-12-06 06:19:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 312 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-06 06:19:12,628 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 109 flow [2022-12-06 06:19:12,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2022-12-06 06:19:12,630 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 06:19:12,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:12,630 INFO L89 Accepts]: Start accepts. Operand has 39 places, 23 transitions, 109 flow [2022-12-06 06:19:12,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:12,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:12,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 109 flow [2022-12-06 06:19:12,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 109 flow [2022-12-06 06:19:12,638 INFO L130 PetriNetUnfolder]: 7/37 cut-off events. [2022-12-06 06:19:12,638 INFO L131 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2022-12-06 06:19:12,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 37 events. 7/37 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 93. Up to 12 conditions per place. [2022-12-06 06:19:12,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 109 flow [2022-12-06 06:19:12,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 06:19:13,282 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:13,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 653 [2022-12-06 06:19:13,283 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 103 flow [2022-12-06 06:19:13,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,284 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:13,284 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:13,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:19:13,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash 322134544, now seen corresponding path program 1 times [2022-12-06 06:19:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:13,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255905828] [2022-12-06 06:19:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255905828] [2022-12-06 06:19:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255905828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:14,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:14,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122634180] [2022-12-06 06:19:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:14,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:14,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:14,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:19:14,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 103 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:14,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:14,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:19:14,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:14,113 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2022-12-06 06:19:14,113 INFO L131 PetriNetUnfolder]: For 119/119 co-relation queries the response was YES. [2022-12-06 06:19:14,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 72 events. 26/72 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 224 event pairs, 3 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 259. Up to 32 conditions per place. [2022-12-06 06:19:14,114 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 16/37 dead transitions. [2022-12-06 06:19:14,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 272 flow [2022-12-06 06:19:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-12-06 06:19:14,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-06 06:19:14,115 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 103 flow. Second operand 6 states and 24 transitions. [2022-12-06 06:19:14,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 272 flow [2022-12-06 06:19:14,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 264 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:14,117 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 108 flow [2022-12-06 06:19:14,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2022-12-06 06:19:14,117 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 06:19:14,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:14,118 INFO L89 Accepts]: Start accepts. Operand has 39 places, 20 transitions, 108 flow [2022-12-06 06:19:14,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:14,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:14,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 20 transitions, 108 flow [2022-12-06 06:19:14,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 20 transitions, 108 flow [2022-12-06 06:19:14,124 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 06:19:14,124 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 06:19:14,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 29 events. 6/29 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 48 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 80. Up to 10 conditions per place. [2022-12-06 06:19:14,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 20 transitions, 108 flow [2022-12-06 06:19:14,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-06 06:19:14,704 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:14,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 587 [2022-12-06 06:19:14,705 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 123 flow [2022-12-06 06:19:14,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:14,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:14,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:14,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:19:14,705 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:14,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1808616713, now seen corresponding path program 1 times [2022-12-06 06:19:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:14,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428600166] [2022-12-06 06:19:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:14,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:19:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:14,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:19:14,821 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:19:14,822 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:19:14,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:19:14,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:19:14,825 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:14,830 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:19:14,830 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:19:14,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:19:14 BasicIcfg [2022-12-06 06:19:14,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:19:14,896 INFO L158 Benchmark]: Toolchain (without parser) took 13441.76ms. Allocated memory was 182.5MB in the beginning and 388.0MB in the end (delta: 205.5MB). Free memory was 157.4MB in the beginning and 318.8MB in the end (delta: -161.4MB). Peak memory consumption was 45.4MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,896 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:19:14,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.09ms. Allocated memory is still 182.5MB. Free memory was 157.4MB in the beginning and 130.2MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 182.5MB. Free memory was 130.2MB in the beginning and 127.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,897 INFO L158 Benchmark]: Boogie Preprocessor took 33.82ms. Allocated memory is still 182.5MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,897 INFO L158 Benchmark]: RCFGBuilder took 683.13ms. Allocated memory is still 182.5MB. Free memory was 125.1MB in the beginning and 90.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,897 INFO L158 Benchmark]: TraceAbstraction took 12076.23ms. Allocated memory was 182.5MB in the beginning and 388.0MB in the end (delta: 205.5MB). Free memory was 89.4MB in the beginning and 318.8MB in the end (delta: -229.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:19:14,898 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.14ms. Allocated memory is still 182.5MB. Free memory is still 159.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 589.09ms. Allocated memory is still 182.5MB. Free memory was 157.4MB in the beginning and 130.2MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 182.5MB. Free memory was 130.2MB in the beginning and 127.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.82ms. Allocated memory is still 182.5MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 683.13ms. Allocated memory is still 182.5MB. Free memory was 125.1MB in the beginning and 90.0MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12076.23ms. Allocated memory was 182.5MB in the beginning and 388.0MB in the end (delta: 205.5MB). Free memory was 89.4MB in the beginning and 318.8MB in the end (delta: -229.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 114 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1758 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1455, independent: 1405, independent conditional: 1405, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1455, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1455, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1455, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1161, independent: 1124, independent conditional: 0, independent unconditional: 1124, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1161, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 220, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1455, independent: 281, independent conditional: 0, independent unconditional: 281, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1161, unknown conditional: 0, unknown unconditional: 1161] , Statistics on independence cache: Total cache size (in pairs): 1787, Positive cache size: 1750, Positive conditional cache size: 0, Positive unconditional cache size: 1750, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 6, independent unconditional: 64, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 70, independent conditional: 6, independent unconditional: 64, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 70, independent conditional: 6, independent unconditional: 64, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 66, independent conditional: 6, independent unconditional: 60, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 82, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 92, dependent conditional: 22, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 82, unknown conditional: 8, unknown unconditional: 74] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 66, Positive conditional cache size: 6, Positive unconditional cache size: 60, Negative cache size: 16, Negative conditional cache size: 2, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 64, independent conditional: 7, independent unconditional: 57, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 75, Positive conditional cache size: 6, Positive unconditional cache size: 69, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 56, independent conditional: 7, independent unconditional: 49, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 75, Positive conditional cache size: 6, Positive unconditional cache size: 69, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 134, independent conditional: 50, independent unconditional: 84, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 134, independent conditional: 38, independent unconditional: 96, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 134, independent conditional: 38, independent unconditional: 96, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 4, independent unconditional: 4, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 126, independent conditional: 34, independent unconditional: 92, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 86, Positive conditional cache size: 10, Positive unconditional cache size: 76, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164, independent: 132, independent conditional: 44, independent unconditional: 88, dependent: 32, dependent conditional: 8, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 132, independent conditional: 32, independent unconditional: 100, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 132, independent conditional: 32, independent unconditional: 100, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 3, independent unconditional: 1, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 164, independent: 128, independent conditional: 29, independent unconditional: 99, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 90, Positive conditional cache size: 13, Positive unconditional cache size: 77, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 43 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 140, independent conditional: 56, independent unconditional: 84, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 140, independent conditional: 42, independent unconditional: 98, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 140, independent conditional: 42, independent unconditional: 98, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 3, independent unconditional: 7, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 162, independent: 130, independent conditional: 39, independent unconditional: 91, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 107, Positive conditional cache size: 16, Positive unconditional cache size: 91, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 45 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 57, independent unconditional: 51, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 108, independent conditional: 48, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 108, independent conditional: 48, independent unconditional: 60, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 106, independent conditional: 46, independent unconditional: 60, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 121, Positive conditional cache size: 18, Positive unconditional cache size: 103, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 38 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 14, independent unconditional: 16, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 30, independent conditional: 13, independent unconditional: 17, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 30, independent conditional: 13, independent unconditional: 17, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 44, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 138, Positive conditional cache size: 20, Positive unconditional cache size: 118, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 37 PlacesBefore, 36 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 174, Positive conditional cache size: 23, Positive unconditional cache size: 151, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=-2, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=-1, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 6 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:19:14,935 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...