/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/mix002.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:16:23,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:16:23,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:16:23,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:16:23,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:16:23,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:16:23,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:16:23,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:16:23,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:16:23,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:16:23,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:16:23,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:16:23,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:16:23,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:16:23,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:16:23,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:16:23,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:16:23,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:16:23,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:16:23,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:16:23,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:16:23,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:16:23,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:16:23,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:16:23,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:16:23,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:16:23,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:16:23,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:16:23,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:16:23,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:16:23,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:16:23,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:16:23,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:16:23,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:16:23,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:16:23,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:16:23,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:16:23,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:16:23,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:16:23,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:16:23,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:16:23,582 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:16:23,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:16:23,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:16:23,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:16:23,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:16:23,614 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:16:23,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:16:23,615 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:16:23,616 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:16:23,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:16:23,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:16:23,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:16:23,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:16:23,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:16:23,617 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:16:23,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:16:23,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:16:23,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:16:23,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:16:23,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:16:23,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:16:23,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:16:23,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:23,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:16:23,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:16:23,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:16:23,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:16:23,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:16:23,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:16:23,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:16:23,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:16:23,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:16:23,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:16:23,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:16:23,958 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:16:23,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-06 06:16:25,178 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:16:25,461 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:16:25,462 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002.oepc.i [2022-12-06 06:16:25,477 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7c75f96/2269bdec16ef45efac0ed9eeef05da6c/FLAG991216625 [2022-12-06 06:16:25,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7c75f96/2269bdec16ef45efac0ed9eeef05da6c [2022-12-06 06:16:25,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:16:25,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:16:25,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:25,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:16:25,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:16:25,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:25" (1/1) ... [2022-12-06 06:16:25,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1372ad96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:25, skipping insertion in model container [2022-12-06 06:16:25,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:25" (1/1) ... [2022-12-06 06:16:25,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:16:25,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:16:25,688 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/mix002.oepc.i[945,958] [2022-12-06 06:16:25,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:25,920 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:16:25,930 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/mix002.oepc.i[945,958] [2022-12-06 06:16:25,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:25,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:25,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:26,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:26,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:26,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:26,046 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:16:26,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26 WrapperNode [2022-12-06 06:16:26,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:26,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:26,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:16:26,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:16:26,054 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:16:26" (1/1) ... [2022-12-06 06:16:26,085 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:16:26" (1/1) ... [2022-12-06 06:16:26,124 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-12-06 06:16:26,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:26,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:16:26,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:16:26,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:16:26,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:16:26,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:16:26,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:16:26,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:16:26,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (1/1) ... [2022-12-06 06:16:26,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:26,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:26,213 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:16:26,230 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:16:26,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:16:26,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:16:26,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:16:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:16:26,251 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:16:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:16:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:16:26,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:16:26,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:16:26,253 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:16:26,368 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:16:26,370 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:16:26,717 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:16:26,856 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:16:26,857 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:16:26,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:26 BoogieIcfgContainer [2022-12-06 06:16:26,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:16:26,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:16:26,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:16:26,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:16:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:16:25" (1/3) ... [2022-12-06 06:16:26,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457b7bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:26, skipping insertion in model container [2022-12-06 06:16:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:26" (2/3) ... [2022-12-06 06:16:26,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457b7bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:26, skipping insertion in model container [2022-12-06 06:16:26,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:26" (3/3) ... [2022-12-06 06:16:26,868 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-12-06 06:16:26,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:16:26,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:16:26,885 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:16:26,941 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:16:26,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-06 06:16:27,053 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-06 06:16:27,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:27,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 06:16:27,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-06 06:16:27,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-06 06:16:27,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:27,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-06 06:16:27,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-12-06 06:16:27,124 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-06 06:16:27,124 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:27,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 06:16:27,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-06 06:16:27,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 2348 [2022-12-06 06:16:32,123 INFO L203 LiptonReduction]: Total number of compositions: 88 [2022-12-06 06:16:32,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:16:32,143 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;@3a9a72a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:16:32,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:16:32,145 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-06 06:16:32,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:32,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:32,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:16:32,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 498149, now seen corresponding path program 1 times [2022-12-06 06:16:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:32,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304225780] [2022-12-06 06:16:32,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:32,500 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:16:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304225780] [2022-12-06 06:16:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304225780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:32,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:32,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997158920] [2022-12-06 06:16:32,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:32,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:32,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:32,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:16:32,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:16:32,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:32,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:16:32,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:32,909 INFO L130 PetriNetUnfolder]: 1416/2143 cut-off events. [2022-12-06 06:16:32,909 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 06:16:32,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 2143 events. 1416/2143 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10516 event pairs, 626 based on Foata normal form. 0/1907 useless extension candidates. Maximal degree in co-relation 4281. Up to 1781 conditions per place. [2022-12-06 06:16:32,922 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 2 changer transitions 8/46 dead transitions. [2022-12-06 06:16:32,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 191 flow [2022-12-06 06:16:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 06:16:32,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2022-12-06 06:16:32,933 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 59 transitions. [2022-12-06 06:16:32,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 191 flow [2022-12-06 06:16:32,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:16:32,938 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 58 flow [2022-12-06 06:16:32,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-06 06:16:32,942 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-06 06:16:32,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:32,943 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 58 flow [2022-12-06 06:16:32,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:32,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:32,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 58 flow [2022-12-06 06:16:32,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2022-12-06 06:16:32,951 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-06 06:16:32,951 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:32,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:16:32,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2022-12-06 06:16:32,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-06 06:16:33,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:33,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 06:16:33,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2022-12-06 06:16:33,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:16:33,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:33,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:33,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:16:33,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2078616218, now seen corresponding path program 1 times [2022-12-06 06:16:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:33,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363579218] [2022-12-06 06:16:33,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:33,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:33,488 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:16:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:33,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363579218] [2022-12-06 06:16:33,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363579218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:33,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486538648] [2022-12-06 06:16:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:33,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:33,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:33,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:33,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:16:33,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 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:16:33,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:33,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:16:33,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:33,776 INFO L130 PetriNetUnfolder]: 1691/2478 cut-off events. [2022-12-06 06:16:33,776 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 06:16:33,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 2478 events. 1691/2478 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10403 event pairs, 891 based on Foata normal form. 4/2482 useless extension candidates. Maximal degree in co-relation 5176. Up to 2449 conditions per place. [2022-12-06 06:16:33,788 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:16:33,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 152 flow [2022-12-06 06:16:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:16:33,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-06 06:16:33,790 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:16:33,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 152 flow [2022-12-06 06:16:33,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:33,791 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 78 flow [2022-12-06 06:16:33,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, 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=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 06:16:33,792 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-12-06 06:16:33,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:33,792 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 78 flow [2022-12-06 06:16:33,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:33,793 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:33,793 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 78 flow [2022-12-06 06:16:33,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 78 flow [2022-12-06 06:16:33,801 INFO L130 PetriNetUnfolder]: 14/71 cut-off events. [2022-12-06 06:16:33,801 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:33,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 71 events. 14/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 241 event pairs, 6 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 104. Up to 29 conditions per place. [2022-12-06 06:16:33,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 78 flow [2022-12-06 06:16:33,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 06:16:33,859 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:33,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-06 06:16:33,860 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 78 flow [2022-12-06 06:16:33,860 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:16:33,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:33,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:33,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:16:33,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 12594005, now seen corresponding path program 1 times [2022-12-06 06:16:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:33,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036311067] [2022-12-06 06:16:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:34,018 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:16:34,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:34,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036311067] [2022-12-06 06:16:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036311067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199562553] [2022-12-06 06:16:34,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:34,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:34,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:16:34,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 78 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:16:34,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:34,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:16:34,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:34,301 INFO L130 PetriNetUnfolder]: 1545/2276 cut-off events. [2022-12-06 06:16:34,301 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-06 06:16:34,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5137 conditions, 2276 events. 1545/2276 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9676 event pairs, 477 based on Foata normal form. 56/2332 useless extension candidates. Maximal degree in co-relation 5126. Up to 1707 conditions per place. [2022-12-06 06:16:34,313 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 36 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-06 06:16:34,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 188 flow [2022-12-06 06:16:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:34,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 06:16:34,315 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 06:16:34,315 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 78 flow. Second operand 3 states and 37 transitions. [2022-12-06 06:16:34,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 188 flow [2022-12-06 06:16:34,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:16:34,317 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 85 flow [2022-12-06 06:16:34,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 06:16:34,317 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2022-12-06 06:16:34,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:34,318 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 85 flow [2022-12-06 06:16:34,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:34,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:34,319 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 85 flow [2022-12-06 06:16:34,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 85 flow [2022-12-06 06:16:34,326 INFO L130 PetriNetUnfolder]: 9/54 cut-off events. [2022-12-06 06:16:34,326 INFO L131 PetriNetUnfolder]: For 7/11 co-relation queries the response was YES. [2022-12-06 06:16:34,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 54 events. 9/54 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 3 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 88. Up to 21 conditions per place. [2022-12-06 06:16:34,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 85 flow [2022-12-06 06:16:34,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 06:16:34,328 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:34,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 06:16:34,330 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 85 flow [2022-12-06 06:16:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:16:34,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:34,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:34,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:16:34,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1847051553, now seen corresponding path program 1 times [2022-12-06 06:16:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:34,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086704390] [2022-12-06 06:16:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:34,445 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:16:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:34,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086704390] [2022-12-06 06:16:34,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086704390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:34,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:34,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46788643] [2022-12-06 06:16:34,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:34,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:34,448 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:16:34,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 85 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:16:34,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:34,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:16:34,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:34,704 INFO L130 PetriNetUnfolder]: 1443/2134 cut-off events. [2022-12-06 06:16:34,704 INFO L131 PetriNetUnfolder]: For 694/694 co-relation queries the response was YES. [2022-12-06 06:16:34,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 2134 events. 1443/2134 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8609 event pairs, 459 based on Foata normal form. 40/2174 useless extension candidates. Maximal degree in co-relation 5022. Up to 1453 conditions per place. [2022-12-06 06:16:34,715 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 06:16:34,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 188 flow [2022-12-06 06:16:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:16:34,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-06 06:16:34,717 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 85 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:16:34,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 188 flow [2022-12-06 06:16:34,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:34,719 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 90 flow [2022-12-06 06:16:34,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 06:16:34,720 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-06 06:16:34,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:34,720 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 90 flow [2022-12-06 06:16:34,721 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:34,721 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:34,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 90 flow [2022-12-06 06:16:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 90 flow [2022-12-06 06:16:34,727 INFO L130 PetriNetUnfolder]: 6/46 cut-off events. [2022-12-06 06:16:34,727 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 06:16:34,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 46 events. 6/46 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 1 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 79. Up to 16 conditions per place. [2022-12-06 06:16:34,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 90 flow [2022-12-06 06:16:34,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 06:16:34,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:34,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 06:16:34,744 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 90 flow [2022-12-06 06:16:34,745 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:16:34,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:34,745 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:34,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:16:34,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:34,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2000096940, now seen corresponding path program 1 times [2022-12-06 06:16:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:34,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781204086] [2022-12-06 06:16:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:34,878 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:16:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:34,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781204086] [2022-12-06 06:16:34,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781204086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:34,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:34,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838130747] [2022-12-06 06:16:34,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:34,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:34,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:34,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 06:16:34,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 90 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:34,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:34,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 06:16:34,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:35,117 INFO L130 PetriNetUnfolder]: 1403/2078 cut-off events. [2022-12-06 06:16:35,117 INFO L131 PetriNetUnfolder]: For 817/817 co-relation queries the response was YES. [2022-12-06 06:16:35,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2078 events. 1403/2078 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8482 event pairs, 791 based on Foata normal form. 16/2094 useless extension candidates. Maximal degree in co-relation 5006. Up to 1801 conditions per place. [2022-12-06 06:16:35,129 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 06:16:35,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 218 flow [2022-12-06 06:16:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 06:16:35,130 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2022-12-06 06:16:35,130 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 90 flow. Second operand 3 states and 40 transitions. [2022-12-06 06:16:35,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 218 flow [2022-12-06 06:16:35,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:35,132 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 95 flow [2022-12-06 06:16:35,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-06 06:16:35,133 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-06 06:16:35,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:35,133 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 95 flow [2022-12-06 06:16:35,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:35,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:35,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 95 flow [2022-12-06 06:16:35,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 95 flow [2022-12-06 06:16:35,140 INFO L130 PetriNetUnfolder]: 5/44 cut-off events. [2022-12-06 06:16:35,140 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:16:35,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 44 events. 5/44 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 111 event pairs, 1 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 78. Up to 14 conditions per place. [2022-12-06 06:16:35,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 95 flow [2022-12-06 06:16:35,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 06:16:35,142 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:35,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:16:35,143 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 95 flow [2022-12-06 06:16:35,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:35,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:35,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:35,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:16:35,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1569757137, now seen corresponding path program 1 times [2022-12-06 06:16:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:35,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921274864] [2022-12-06 06:16:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:35,338 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:16:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:35,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921274864] [2022-12-06 06:16:35,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921274864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:35,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:35,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652424767] [2022-12-06 06:16:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:35,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:35,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:35,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 06:16:35,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:35,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:35,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 06:16:35,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:35,526 INFO L130 PetriNetUnfolder]: 623/1052 cut-off events. [2022-12-06 06:16:35,526 INFO L131 PetriNetUnfolder]: For 451/463 co-relation queries the response was YES. [2022-12-06 06:16:35,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1052 events. 623/1052 cut-off events. For 451/463 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5356 event pairs, 157 based on Foata normal form. 104/1129 useless extension candidates. Maximal degree in co-relation 2552. Up to 369 conditions per place. [2022-12-06 06:16:35,532 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 40 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2022-12-06 06:16:35,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 249 flow [2022-12-06 06:16:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:16:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:16:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 06:16:35,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2022-12-06 06:16:35,533 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 95 flow. Second operand 4 states and 62 transitions. [2022-12-06 06:16:35,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 249 flow [2022-12-06 06:16:35,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:35,535 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 127 flow [2022-12-06 06:16:35,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 06:16:35,536 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-06 06:16:35,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:35,536 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 127 flow [2022-12-06 06:16:35,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:35,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:35,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 127 flow [2022-12-06 06:16:35,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 127 flow [2022-12-06 06:16:35,548 INFO L130 PetriNetUnfolder]: 32/114 cut-off events. [2022-12-06 06:16:35,548 INFO L131 PetriNetUnfolder]: For 59/72 co-relation queries the response was YES. [2022-12-06 06:16:35,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 114 events. 32/114 cut-off events. For 59/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 536 event pairs, 10 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 272. Up to 67 conditions per place. [2022-12-06 06:16:35,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 127 flow [2022-12-06 06:16:35,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-06 06:16:35,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:35,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 06:16:35,705 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 129 flow [2022-12-06 06:16:35,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:35,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:35,705 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:16:35,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:16:35,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1208877179, now seen corresponding path program 1 times [2022-12-06 06:16:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:35,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239562528] [2022-12-06 06:16:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:35,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:35,876 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:16:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:35,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239562528] [2022-12-06 06:16:35,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239562528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:35,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:35,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:16:35,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586811772] [2022-12-06 06:16:35,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:35,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:16:35,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:16:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:16:35,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 06:16:35,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:35,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:35,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 06:16:35,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:36,037 INFO L130 PetriNetUnfolder]: 311/574 cut-off events. [2022-12-06 06:16:36,037 INFO L131 PetriNetUnfolder]: For 286/287 co-relation queries the response was YES. [2022-12-06 06:16:36,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 574 events. 311/574 cut-off events. For 286/287 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2609 event pairs, 67 based on Foata normal form. 56/613 useless extension candidates. Maximal degree in co-relation 1657. Up to 240 conditions per place. [2022-12-06 06:16:36,041 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 49 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2022-12-06 06:16:36,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 335 flow [2022-12-06 06:16:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:16:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:16:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 06:16:36,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 06:16:36,042 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 129 flow. Second operand 5 states and 78 transitions. [2022-12-06 06:16:36,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 335 flow [2022-12-06 06:16:36,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 325 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:36,045 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 168 flow [2022-12-06 06:16:36,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-06 06:16:36,046 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2022-12-06 06:16:36,046 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:36,046 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 168 flow [2022-12-06 06:16:36,047 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:36,047 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:36,047 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 168 flow [2022-12-06 06:16:36,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 168 flow [2022-12-06 06:16:36,063 INFO L130 PetriNetUnfolder]: 22/91 cut-off events. [2022-12-06 06:16:36,063 INFO L131 PetriNetUnfolder]: For 109/119 co-relation queries the response was YES. [2022-12-06 06:16:36,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 91 events. 22/91 cut-off events. For 109/119 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 349 event pairs, 2 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 263. Up to 43 conditions per place. [2022-12-06 06:16:36,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 168 flow [2022-12-06 06:16:36,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 06:16:36,311 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:36,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-06 06:16:36,312 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 172 flow [2022-12-06 06:16:36,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:36,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:36,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:36,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:16:36,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1267896980, now seen corresponding path program 1 times [2022-12-06 06:16:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:36,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118479227] [2022-12-06 06:16:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:36,487 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:16:36,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:36,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118479227] [2022-12-06 06:16:36,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118479227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:36,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:36,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:36,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071337416] [2022-12-06 06:16:36,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:36,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:36,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:36,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:36,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:36,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 06:16:36,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 172 flow. Second operand has 4 states, 3 states have (on average 6.666666666666667) 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:16:36,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:36,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 06:16:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:36,686 INFO L130 PetriNetUnfolder]: 590/1028 cut-off events. [2022-12-06 06:16:36,686 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2022-12-06 06:16:36,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1028 events. 590/1028 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4670 event pairs, 35 based on Foata normal form. 9/1037 useless extension candidates. Maximal degree in co-relation 3288. Up to 646 conditions per place. [2022-12-06 06:16:36,692 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 61 selfloop transitions, 13 changer transitions 2/76 dead transitions. [2022-12-06 06:16:36,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 521 flow [2022-12-06 06:16:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:16:36,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:16:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 06:16:36,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-06 06:16:36,695 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 172 flow. Second operand 5 states and 61 transitions. [2022-12-06 06:16:36,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 521 flow [2022-12-06 06:16:36,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 464 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-06 06:16:36,702 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 225 flow [2022-12-06 06:16:36,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-06 06:16:36,704 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-12-06 06:16:36,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:36,704 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 225 flow [2022-12-06 06:16:36,706 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:36,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:36,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 225 flow [2022-12-06 06:16:36,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 225 flow [2022-12-06 06:16:36,732 INFO L130 PetriNetUnfolder]: 61/221 cut-off events. [2022-12-06 06:16:36,733 INFO L131 PetriNetUnfolder]: For 153/182 co-relation queries the response was YES. [2022-12-06 06:16:36,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 221 events. 61/221 cut-off events. For 153/182 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1102 event pairs, 14 based on Foata normal form. 10/223 useless extension candidates. Maximal degree in co-relation 596. Up to 62 conditions per place. [2022-12-06 06:16:36,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 225 flow [2022-12-06 06:16:36,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 06:16:36,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:36,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 06:16:36,887 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 225 flow [2022-12-06 06:16:36,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) 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:16:36,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:36,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:36,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:16:36,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:36,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -526167127, now seen corresponding path program 1 times [2022-12-06 06:16:36,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:36,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671508435] [2022-12-06 06:16:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:36,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:37,047 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:16:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:37,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671508435] [2022-12-06 06:16:37,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671508435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:37,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:37,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723276076] [2022-12-06 06:16:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:37,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:37,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:37,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:16:37,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:37,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:37,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:16:37,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:37,239 INFO L130 PetriNetUnfolder]: 660/1206 cut-off events. [2022-12-06 06:16:37,239 INFO L131 PetriNetUnfolder]: For 1293/1321 co-relation queries the response was YES. [2022-12-06 06:16:37,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 1206 events. 660/1206 cut-off events. For 1293/1321 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6220 event pairs, 154 based on Foata normal form. 20/1202 useless extension candidates. Maximal degree in co-relation 3964. Up to 545 conditions per place. [2022-12-06 06:16:37,246 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 49 selfloop transitions, 2 changer transitions 18/74 dead transitions. [2022-12-06 06:16:37,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 536 flow [2022-12-06 06:16:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:16:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:16:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:16:37,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-06 06:16:37,247 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 225 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:16:37,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 536 flow [2022-12-06 06:16:37,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 532 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 06:16:37,251 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 240 flow [2022-12-06 06:16:37,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-06 06:16:37,251 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2022-12-06 06:16:37,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:37,252 INFO L89 Accepts]: Start accepts. Operand has 51 places, 41 transitions, 240 flow [2022-12-06 06:16:37,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:37,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:37,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 240 flow [2022-12-06 06:16:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 240 flow [2022-12-06 06:16:37,311 INFO L130 PetriNetUnfolder]: 82/307 cut-off events. [2022-12-06 06:16:37,311 INFO L131 PetriNetUnfolder]: For 282/345 co-relation queries the response was YES. [2022-12-06 06:16:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 307 events. 82/307 cut-off events. For 282/345 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1820 event pairs, 14 based on Foata normal form. 15/310 useless extension candidates. Maximal degree in co-relation 848. Up to 104 conditions per place. [2022-12-06 06:16:37,314 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 240 flow [2022-12-06 06:16:37,314 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 06:16:37,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [481] $Ultimate##0-->L815: Formula: (and (= v_~z~0_51 1) (= v_~z~0_51 v_~__unbuffered_p2_EAX~0_92) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0] and [354] L792-->L795: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-06 06:16:37,381 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:16:37,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 06:16:37,382 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 252 flow [2022-12-06 06:16:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:37,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:37,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:37,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:16:37,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1454980957, now seen corresponding path program 1 times [2022-12-06 06:16:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:37,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608187088] [2022-12-06 06:16:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:37,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:37,599 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:16:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:37,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608187088] [2022-12-06 06:16:37,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608187088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:37,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:37,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:16:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183722049] [2022-12-06 06:16:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:16:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:16:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:16:37,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 06:16:37,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 252 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:37,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:37,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 06:16:37,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:37,921 INFO L130 PetriNetUnfolder]: 976/1768 cut-off events. [2022-12-06 06:16:37,921 INFO L131 PetriNetUnfolder]: For 2277/2277 co-relation queries the response was YES. [2022-12-06 06:16:37,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6092 conditions, 1768 events. 976/1768 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9555 event pairs, 341 based on Foata normal form. 9/1777 useless extension candidates. Maximal degree in co-relation 6069. Up to 931 conditions per place. [2022-12-06 06:16:37,928 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 50 selfloop transitions, 6 changer transitions 27/83 dead transitions. [2022-12-06 06:16:37,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 596 flow [2022-12-06 06:16:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 06:16:37,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2022-12-06 06:16:37,930 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 252 flow. Second operand 6 states and 64 transitions. [2022-12-06 06:16:37,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 596 flow [2022-12-06 06:16:37,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 590 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:16:37,934 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 199 flow [2022-12-06 06:16:37,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2022-12-06 06:16:37,935 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2022-12-06 06:16:37,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:37,935 INFO L89 Accepts]: Start accepts. Operand has 56 places, 34 transitions, 199 flow [2022-12-06 06:16:37,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:37,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:37,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 34 transitions, 199 flow [2022-12-06 06:16:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 34 transitions, 199 flow [2022-12-06 06:16:37,960 INFO L130 PetriNetUnfolder]: 58/269 cut-off events. [2022-12-06 06:16:37,960 INFO L131 PetriNetUnfolder]: For 353/388 co-relation queries the response was YES. [2022-12-06 06:16:37,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 269 events. 58/269 cut-off events. For 353/388 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1660 event pairs, 16 based on Foata normal form. 12/273 useless extension candidates. Maximal degree in co-relation 744. Up to 101 conditions per place. [2022-12-06 06:16:37,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 34 transitions, 199 flow [2022-12-06 06:16:37,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 06:16:38,011 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:16:38,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 06:16:38,012 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 191 flow [2022-12-06 06:16:38,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:38,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:38,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:38,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:16:38,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -267109463, now seen corresponding path program 1 times [2022-12-06 06:16:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549890199] [2022-12-06 06:16:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:38,178 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:16:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:38,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549890199] [2022-12-06 06:16:38,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549890199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:38,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:38,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:16:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998037109] [2022-12-06 06:16:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:38,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:16:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:38,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:16:38,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:16:38,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-06 06:16:38,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:38,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:38,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-06 06:16:38,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:38,351 INFO L130 PetriNetUnfolder]: 402/820 cut-off events. [2022-12-06 06:16:38,351 INFO L131 PetriNetUnfolder]: For 1132/1135 co-relation queries the response was YES. [2022-12-06 06:16:38,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 820 events. 402/820 cut-off events. For 1132/1135 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4494 event pairs, 115 based on Foata normal form. 42/845 useless extension candidates. Maximal degree in co-relation 2674. Up to 301 conditions per place. [2022-12-06 06:16:38,355 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 11 changer transitions 8/53 dead transitions. [2022-12-06 06:16:38,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 370 flow [2022-12-06 06:16:38,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-06 06:16:38,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2022-12-06 06:16:38,357 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 191 flow. Second operand 6 states and 67 transitions. [2022-12-06 06:16:38,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 370 flow [2022-12-06 06:16:38,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 329 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-06 06:16:38,359 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 169 flow [2022-12-06 06:16:38,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2022-12-06 06:16:38,360 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-12-06 06:16:38,360 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:38,360 INFO L89 Accepts]: Start accepts. Operand has 53 places, 28 transitions, 169 flow [2022-12-06 06:16:38,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:38,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:38,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 28 transitions, 169 flow [2022-12-06 06:16:38,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 28 transitions, 169 flow [2022-12-06 06:16:38,369 INFO L130 PetriNetUnfolder]: 12/63 cut-off events. [2022-12-06 06:16:38,369 INFO L131 PetriNetUnfolder]: For 97/109 co-relation queries the response was YES. [2022-12-06 06:16:38,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 63 events. 12/63 cut-off events. For 97/109 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 193 event pairs, 4 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 192. Up to 20 conditions per place. [2022-12-06 06:16:38,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 28 transitions, 169 flow [2022-12-06 06:16:38,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 06:16:38,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L779-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P0Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_9|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [465] L860-3-->L863: Formula: (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_77) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0] [2022-12-06 06:16:38,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [419] L838-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [489] L860-3-->L871: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_194 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_497 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_193 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_498 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_447 256) 0)) .cse4))) (and (= v_~a~0_374 (ite .cse0 v_~a$w_buff0~0_283 (ite .cse1 v_~a$w_buff1~0_234 v_~a~0_375))) (= v_~a$w_buff0_used~0_497 (ite .cse0 0 v_~a$w_buff0_used~0_498)) (= v_~main$tmp_guard0~0_124 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_193) v_~a$r_buff0_thd0~0_192) (= (mod v_~main$tmp_guard0~0_124 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~a$r_buff1_thd0~0_193 (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_446 256) 0)))) 0 v_~a$r_buff1_thd0~0_194)) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_447) v_~a$w_buff1_used~0_446)))) InVars {~a~0=v_~a~0_375, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_194, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_498, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_447} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_497, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_124, ~a~0=v_~a~0_374, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_193, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:16:38,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L802-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [489] L860-3-->L871: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_194 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_497 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_193 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_498 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_447 256) 0)) .cse4))) (and (= v_~a~0_374 (ite .cse0 v_~a$w_buff0~0_283 (ite .cse1 v_~a$w_buff1~0_234 v_~a~0_375))) (= v_~a$w_buff0_used~0_497 (ite .cse0 0 v_~a$w_buff0_used~0_498)) (= v_~main$tmp_guard0~0_124 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_193) v_~a$r_buff0_thd0~0_192) (= (mod v_~main$tmp_guard0~0_124 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~a$r_buff1_thd0~0_193 (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_446 256) 0)))) 0 v_~a$r_buff1_thd0~0_194)) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_447) v_~a$w_buff1_used~0_446)))) InVars {~a~0=v_~a~0_375, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_194, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_498, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_447} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_497, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_124, ~a~0=v_~a~0_374, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_193, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:16:39,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L779-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_29 (+ v_~__unbuffered_cnt~0_30 1)) (= |v_P0Thread1of1ForFork1_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork1_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_9|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [489] L860-3-->L871: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd0~0_194 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_497 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_193 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_498 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~a$w_buff1_used~0_447 256) 0)) .cse4))) (and (= v_~a~0_374 (ite .cse0 v_~a$w_buff0~0_283 (ite .cse1 v_~a$w_buff1~0_234 v_~a~0_375))) (= v_~a$w_buff0_used~0_497 (ite .cse0 0 v_~a$w_buff0_used~0_498)) (= v_~main$tmp_guard0~0_124 (ite (= (ite (= v_~__unbuffered_cnt~0_161 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= (ite .cse2 0 v_~a$r_buff0_thd0~0_193) v_~a$r_buff0_thd0~0_192) (= (mod v_~main$tmp_guard0~0_124 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~a$r_buff1_thd0~0_193 (ite (or (and (not (= (mod v_~a$r_buff0_thd0~0_192 256) 0)) .cse3) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_446 256) 0)))) 0 v_~a$r_buff1_thd0~0_194)) (= (ite (or .cse2 .cse1) 0 v_~a$w_buff1_used~0_447) v_~a$w_buff1_used~0_446)))) InVars {~a~0=v_~a~0_375, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_194, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_498, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_193, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_447} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_497, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_192, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_124, ~a~0=v_~a~0_374, ~a$w_buff1~0=v_~a$w_buff1~0_234, ~a$w_buff0~0=v_~a$w_buff0~0_283, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_193, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:16:39,896 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:16:39,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1537 [2022-12-06 06:16:39,897 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 21 transitions, 155 flow [2022-12-06 06:16:39,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:39,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:39,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:39,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:16:39,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:39,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2038159968, now seen corresponding path program 1 times [2022-12-06 06:16:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:39,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73207056] [2022-12-06 06:16:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:39,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:40,713 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:16:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:40,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73207056] [2022-12-06 06:16:40,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73207056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:40,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:40,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:16:40,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889341954] [2022-12-06 06:16:40,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:40,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:16:40,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:40,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:16:40,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:16:40,716 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:16:40,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 21 transitions, 155 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:16:40,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:40,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:16:40,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:40,936 INFO L130 PetriNetUnfolder]: 116/251 cut-off events. [2022-12-06 06:16:40,936 INFO L131 PetriNetUnfolder]: For 642/642 co-relation queries the response was YES. [2022-12-06 06:16:40,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 251 events. 116/251 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1011 event pairs, 28 based on Foata normal form. 3/254 useless extension candidates. Maximal degree in co-relation 922. Up to 116 conditions per place. [2022-12-06 06:16:40,937 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 26 selfloop transitions, 4 changer transitions 19/49 dead transitions. [2022-12-06 06:16:40,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 392 flow [2022-12-06 06:16:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-06 06:16:40,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41228070175438597 [2022-12-06 06:16:40,939 INFO L175 Difference]: Start difference. First operand has 44 places, 21 transitions, 155 flow. Second operand 6 states and 47 transitions. [2022-12-06 06:16:40,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 392 flow [2022-12-06 06:16:40,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 280 flow, removed 22 selfloop flow, removed 11 redundant places. [2022-12-06 06:16:40,941 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 115 flow [2022-12-06 06:16:40,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-06 06:16:40,942 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-12-06 06:16:40,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:40,942 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 115 flow [2022-12-06 06:16:40,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:40,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:40,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 115 flow [2022-12-06 06:16:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 23 transitions, 115 flow [2022-12-06 06:16:40,950 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-06 06:16:40,950 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-12-06 06:16:40,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 42 events. 6/42 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 93. Up to 12 conditions per place. [2022-12-06 06:16:40,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 115 flow [2022-12-06 06:16:40,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 06:16:41,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] $Ultimate##0-->L772: Formula: (and (= v_~a$r_buff0_thd0~0_190 v_~a$r_buff1_thd0~0_191) (= v_~a$r_buff0_thd1~0_179 v_~a$r_buff1_thd1~0_135) (= |v_P0Thread1of1ForFork1_~arg#1.offset_39| |v_P0Thread1of1ForFork1_#in~arg#1.offset_39|) (= v_~a$w_buff0~0_276 v_~a$w_buff1~0_228) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_487 256) 0)) (not (= (mod v_~a$w_buff1_used~0_438 256) 0)))) 1 0)) (= v_~a$r_buff0_thd2~0_118 v_~a$r_buff1_thd2~0_124) (= v_~x~0_45 1) (= v_~a$r_buff0_thd3~0_214 v_~a$r_buff1_thd3~0_222) (= v_~a$w_buff0~0_275 1) (= |v_P0Thread1of1ForFork1_~arg#1.base_39| |v_P0Thread1of1ForFork1_#in~arg#1.base_39|) (= v_~a$w_buff0_used~0_488 v_~a$w_buff1_used~0_438) (= v_~a$r_buff0_thd1~0_178 1) (= v_~x~0_45 v_~__unbuffered_p0_EAX~0_111) (= v_~__unbuffered_p0_EBX~0_101 v_~y~0_63) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|) (= v_~a$w_buff0_used~0_487 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41| 0))) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_39|, ~a$w_buff0~0=v_~a$w_buff0~0_276, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_214, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_488, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_179, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_39|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_190, ~y~0=v_~y~0_63} OutVars{~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_101, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_39|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_135, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_222, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_124, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_118, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_214, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_487, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_178, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_39|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_190, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_39|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_39|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~a$w_buff1~0=v_~a$w_buff1~0_228, ~a$w_buff0~0=v_~a$w_buff0~0_275, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_41|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_191, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_438, ~y~0=v_~y~0_63, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_41|, ~x~0=v_~x~0_45} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] and [497] $Ultimate##0-->L802: Formula: (let ((.cse1 (not (= (mod v_~a$w_buff0_used~0_531 256) 0))) (.cse2 (not (= (mod v_~a$r_buff1_thd2~0_135 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_129 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~a$w_buff0_used~0_532 256))) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_481 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_532) v_~a$w_buff0_used~0_531) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_128 256) 0)) .cse1) (and (not (= (mod v_~a$w_buff1_used~0_480 256) 0)) .cse2)) 0 v_~a$r_buff1_thd2~0_135) v_~a$r_buff1_thd2~0_134) (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= v_~y~0_65 v_~__unbuffered_p1_EAX~0_104) (= (ite .cse3 0 v_~a$r_buff0_thd2~0_129) v_~a$r_buff0_thd2~0_128) (= v_~y~0_65 1) (= v_~z~0_61 v_~__unbuffered_p1_EBX~0_107) (= v_~a~0_408 (ite .cse0 v_~a$w_buff0~0_301 (ite .cse4 v_~a$w_buff1~0_252 v_~a~0_409))) (= v_~a$w_buff1_used~0_480 (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_481)) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21)))) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~a~0=v_~a~0_409, ~a$w_buff1~0=v_~a$w_buff1~0_252, ~a$w_buff0~0=v_~a$w_buff0~0_301, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_135, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_129, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_532, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_481, ~z~0=v_~z~0_61} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_107, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_134, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_128, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_531, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~a~0=v_~a~0_408, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~a$w_buff1~0=v_~a$w_buff1~0_252, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~a$w_buff0~0=v_~a$w_buff0~0_301, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_480, ~z~0=v_~z~0_61, ~y~0=v_~y~0_65} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0, ~y~0] [2022-12-06 06:16:41,909 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:16:41,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 968 [2022-12-06 06:16:41,911 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 124 flow [2022-12-06 06:16:41,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:16:41,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:41,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:41,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:16:41,911 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:41,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1868139637, now seen corresponding path program 1 times [2022-12-06 06:16:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827769038] [2022-12-06 06:16:41,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:42,389 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:16:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:42,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827769038] [2022-12-06 06:16:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827769038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:42,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:16:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794426703] [2022-12-06 06:16:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:42,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:16:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:16:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:16:42,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 06:16:42,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 124 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:16:42,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:42,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 06:16:42,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:42,563 INFO L130 PetriNetUnfolder]: 63/153 cut-off events. [2022-12-06 06:16:42,563 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-06 06:16:42,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 153 events. 63/153 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 577 event pairs, 2 based on Foata normal form. 3/156 useless extension candidates. Maximal degree in co-relation 498. Up to 61 conditions per place. [2022-12-06 06:16:42,564 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 33 selfloop transitions, 8 changer transitions 9/50 dead transitions. [2022-12-06 06:16:42,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 343 flow [2022-12-06 06:16:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-06 06:16:42,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 06:16:42,566 INFO L175 Difference]: Start difference. First operand has 38 places, 22 transitions, 124 flow. Second operand 6 states and 45 transitions. [2022-12-06 06:16:42,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 343 flow [2022-12-06 06:16:42,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 309 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-06 06:16:42,567 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 158 flow [2022-12-06 06:16:42,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2022-12-06 06:16:42,568 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-06 06:16:42,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:42,568 INFO L89 Accepts]: Start accepts. Operand has 40 places, 26 transitions, 158 flow [2022-12-06 06:16:42,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:42,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:42,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 158 flow [2022-12-06 06:16:42,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 158 flow [2022-12-06 06:16:42,576 INFO L130 PetriNetUnfolder]: 8/46 cut-off events. [2022-12-06 06:16:42,576 INFO L131 PetriNetUnfolder]: For 59/70 co-relation queries the response was YES. [2022-12-06 06:16:42,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 46 events. 8/46 cut-off events. For 59/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 119. Up to 10 conditions per place. [2022-12-06 06:16:42,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 158 flow [2022-12-06 06:16:42,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 06:16:43,056 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:43,057 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 489 [2022-12-06 06:16:43,057 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 161 flow [2022-12-06 06:16:43,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:16:43,057 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:43,057 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:43,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:16:43,057 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:16:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1899851331, now seen corresponding path program 2 times [2022-12-06 06:16:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:43,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480710987] [2022-12-06 06:16:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:43,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:16:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:43,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:16:43,195 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:16:43,196 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:16:43,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:16:43,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:16:43,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:16:43,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:16:43,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:16:43,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:16:43,201 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:43,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:16:43,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:16:43,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:16:43 BasicIcfg [2022-12-06 06:16:43,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:16:43,318 INFO L158 Benchmark]: Toolchain (without parser) took 17826.09ms. Allocated memory was 188.7MB in the beginning and 393.2MB in the end (delta: 204.5MB). Free memory was 162.5MB in the beginning and 137.8MB in the end (delta: 24.7MB). Peak memory consumption was 230.2MB. Max. memory is 8.0GB. [2022-12-06 06:16:43,318 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 188.7MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:16:43,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.06ms. Allocated memory is still 188.7MB. Free memory was 162.0MB in the beginning and 134.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:16:43,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.22ms. Allocated memory is still 188.7MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:43,319 INFO L158 Benchmark]: Boogie Preprocessor took 52.46ms. Allocated memory is still 188.7MB. Free memory was 132.1MB in the beginning and 130.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:16:43,324 INFO L158 Benchmark]: RCFGBuilder took 681.52ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 95.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:16:43,325 INFO L158 Benchmark]: TraceAbstraction took 16455.72ms. Allocated memory was 188.7MB in the beginning and 393.2MB in the end (delta: 204.5MB). Free memory was 95.4MB in the beginning and 137.8MB in the end (delta: -42.4MB). Peak memory consumption was 163.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:43,326 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.16ms. Allocated memory is still 188.7MB. Free memory was 165.4MB in the beginning and 165.3MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 554.06ms. Allocated memory is still 188.7MB. Free memory was 162.0MB in the beginning and 134.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.22ms. Allocated memory is still 188.7MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.46ms. Allocated memory is still 188.7MB. Free memory was 132.1MB in the beginning and 130.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 681.52ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 95.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16455.72ms. Allocated memory was 188.7MB in the beginning and 393.2MB in the end (delta: 204.5MB). Free memory was 95.4MB in the beginning and 137.8MB in the end (delta: -42.4MB). Peak memory consumption was 163.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 122 PlacesBefore, 40 PlacesAfterwards, 114 TransitionsBefore, 31 TransitionsAfterwards, 2348 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 1825, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1889, independent: 1825, independent conditional: 0, independent unconditional: 1825, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1418, independent: 1375, independent conditional: 0, independent unconditional: 1375, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1418, independent: 1367, independent conditional: 0, independent unconditional: 1367, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 220, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1889, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 1418, unknown conditional: 0, unknown unconditional: 1418] , Statistics on independence cache: Total cache size (in pairs): 2082, Positive cache size: 2039, Positive conditional cache size: 0, Positive unconditional cache size: 2039, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 284, independent conditional: 284, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 337, independent: 284, independent conditional: 29, independent unconditional: 255, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 337, independent: 284, independent conditional: 29, independent unconditional: 255, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 337, independent: 284, independent conditional: 29, independent unconditional: 255, dependent: 53, dependent conditional: 5, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 169, independent: 145, independent conditional: 20, independent unconditional: 125, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 169, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 132, dependent conditional: 21, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 337, independent: 139, independent conditional: 9, independent unconditional: 130, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 169, unknown conditional: 24, unknown unconditional: 145] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 145, Positive conditional cache size: 20, Positive unconditional cache size: 125, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, 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.1s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 8, independent unconditional: 81, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 163, Positive conditional cache size: 20, Positive unconditional cache size: 143, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 13, independent unconditional: 70, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 104, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 163, Positive conditional cache size: 20, Positive unconditional cache size: 143, Negative cache size: 31, Negative conditional cache size: 4, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 84, 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: 106, independent: 84, independent conditional: 7, independent unconditional: 77, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, independent: 84, independent conditional: 0, independent unconditional: 84, 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: 106, independent: 84, independent conditional: 0, independent unconditional: 84, 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: 2, independent: 1, independent conditional: 0, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 164, Positive conditional cache size: 20, Positive unconditional cache size: 144, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 84, independent conditional: 84, 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: 106, independent: 84, independent conditional: 9, independent unconditional: 75, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 108, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 164, Positive conditional cache size: 20, Positive unconditional cache size: 144, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 190, independent conditional: 190, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 190, independent conditional: 45, independent unconditional: 145, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 190, independent conditional: 6, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 190, independent conditional: 6, independent unconditional: 184, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 185, independent conditional: 6, independent unconditional: 179, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 178, Positive conditional cache size: 20, Positive unconditional cache size: 158, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 135, independent conditional: 79, independent unconditional: 56, dependent: 48, dependent conditional: 23, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 135, independent conditional: 4, independent unconditional: 131, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 135, independent conditional: 4, independent unconditional: 131, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 198, Positive conditional cache size: 20, Positive unconditional cache size: 178, Negative cache size: 44, Negative conditional cache size: 4, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 102, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 46 PlacesBefore, 46 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 193, independent conditional: 193, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 193, independent conditional: 145, independent unconditional: 48, dependent: 39, dependent conditional: 12, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 193, independent conditional: 78, independent unconditional: 115, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 193, independent conditional: 78, independent unconditional: 115, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 11, independent unconditional: 1, 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: 15, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 181, independent conditional: 67, independent unconditional: 114, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 15, unknown conditional: 11, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 216, Positive conditional cache size: 31, Positive unconditional cache size: 185, Negative cache size: 47, Negative conditional cache size: 4, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 261, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 261, independent: 210, independent conditional: 166, independent unconditional: 44, dependent: 51, dependent conditional: 6, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 261, independent: 210, independent conditional: 110, independent unconditional: 100, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 261, independent: 210, independent conditional: 110, independent unconditional: 100, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 261, independent: 198, independent conditional: 99, independent unconditional: 99, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 261, Positive conditional cache size: 42, Positive unconditional cache size: 219, Negative cache size: 47, Negative conditional cache size: 4, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 54 PlacesAfterwards, 34 TransitionsBefore, 32 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 124, 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: 152, independent: 124, independent conditional: 8, independent unconditional: 116, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 124, independent conditional: 4, independent unconditional: 120, 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: 152, independent: 124, independent conditional: 4, independent unconditional: 120, 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: 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] , 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: 152, independent: 122, independent conditional: 4, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 317, Positive conditional cache size: 46, Positive unconditional cache size: 271, Negative cache size: 47, Negative conditional cache size: 4, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 50 PlacesBefore, 44 PlacesAfterwards, 28 TransitionsBefore, 21 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 74, independent conditional: 22, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 74, independent conditional: 21, independent unconditional: 53, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 74, independent conditional: 21, independent unconditional: 53, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 95, independent: 67, independent conditional: 15, independent unconditional: 52, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 419, Positive conditional cache size: 54, Positive unconditional cache size: 365, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, 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: 1.0s, 39 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 31, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 462, Positive conditional cache size: 62, Positive unconditional cache size: 400, Negative cache size: 49, Negative conditional cache size: 4, Negative unconditional cache size: 45, 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.5s, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 466, Positive conditional cache size: 65, Positive unconditional cache size: 401, Negative cache size: 51, Negative conditional cache size: 4, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-2, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=-1, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x [L771] 1 __unbuffered_p0_EBX = y [L788] 1 y = 1 [L791] 1 __unbuffered_p1_EAX = y [L794] 1 __unbuffered_p1_EBX = z [L797] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 [L814] 3 __unbuffered_p2_EAX = z [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 3 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 3 !(!cond) [L864] RET 3 assume_abort_if_not(main$tmp_guard0) [L866] 3 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 3 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 3 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L873] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 3 !expression [L18] 3 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=1, y=1, 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: 860]: 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: 856]: 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: 858]: 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, 148 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: 16.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 28 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:16:43,434 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...