/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/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:47:10,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:47:10,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:47:10,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:47:10,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:47:10,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:47:10,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:47:10,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:47:10,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:47:10,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:47:10,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:47:10,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:47:10,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:47:10,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:47:10,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:47:10,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:47:10,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:47:10,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:47:10,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:47:10,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:47:10,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:47:10,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:47:10,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:47:10,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:47:10,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:47:10,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:47:10,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:47:10,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:47:10,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:47:10,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:47:10,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:47:10,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:47:10,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:47:10,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:47:10,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:47:10,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:47:10,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:47:10,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:47:10,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:47:10,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:47:10,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:47:10,889 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-13 11:47:10,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:47:10,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:47:10,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:47:10,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:47:10,916 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:47:10,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:47:10,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:47:10,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:47:10,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:47:10,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:47:10,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:47:10,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:47:10,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:47:10,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:47:10,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:47:10,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:47:11,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:47:11,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:47:11,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:47:11,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:47:11,202 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:47:11,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-12-13 11:47:12,214 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:47:12,380 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:47:12,380 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-12-13 11:47:12,413 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646c94381/78daf0a93975498c84bec2939ed4005f/FLAGe359a2b96 [2022-12-13 11:47:12,423 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646c94381/78daf0a93975498c84bec2939ed4005f [2022-12-13 11:47:12,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:47:12,426 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:47:12,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:47:12,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:47:12,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:47:12,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:12,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb52a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12, skipping insertion in model container [2022-12-13 11:47:12,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:12,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:47:12,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:47:12,615 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/mix017_pso.opt_tso.opt.i[956,969] [2022-12-13 11:47:12,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:47:12,822 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:47:12,830 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/mix017_pso.opt_tso.opt.i[956,969] [2022-12-13 11:47:12,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:47:12,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:47:12,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:47:12,932 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:47:12,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12 WrapperNode [2022-12-13 11:47:12,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:47:12,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:47:12,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:47:12,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:47:12,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:12,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,000 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-13 11:47:13,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:47:13,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:47:13,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:47:13,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:47:13,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,038 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:47:13,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:47:13,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:47:13,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:47:13,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (1/1) ... [2022-12-13 11:47:13,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:47:13,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:47:13,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:47:13,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:47:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:47:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:47:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:47:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:47:13,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:47:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:47:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:47:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:47:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:47:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:47:13,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:47:13,101 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:47:13,266 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:47:13,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:47:13,508 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:47:13,636 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:47:13,636 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:47:13,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:47:13 BoogieIcfgContainer [2022-12-13 11:47:13,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:47:13,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:47:13,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:47:13,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:47:13,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:47:12" (1/3) ... [2022-12-13 11:47:13,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c9fdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:47:13, skipping insertion in model container [2022-12-13 11:47:13,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:47:12" (2/3) ... [2022-12-13 11:47:13,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c9fdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:47:13, skipping insertion in model container [2022-12-13 11:47:13,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:47:13" (3/3) ... [2022-12-13 11:47:13,644 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-12-13 11:47:13,657 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:47:13,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:47:13,658 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:47:13,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:47:13,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 11:47:13,822 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 11:47:13,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:47:13,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 11:47:13,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 11:47:13,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-13 11:47:13,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:13,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 11:47:13,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-13 11:47:13,881 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 11:47:13,881 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:47:13,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2022-12-13 11:47:13,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 11:47:13,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 2718 [2022-12-13 11:47:18,466 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 11:47:18,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:47:18,509 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;@34360fc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:47:18,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:47:18,525 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 11:47:18,525 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:47:18,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:18,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:18,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1912470693, now seen corresponding path program 1 times [2022-12-13 11:47:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:18,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696637458] [2022-12-13 11:47:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:18,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696637458] [2022-12-13 11:47:18,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696637458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:18,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:18,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:47:18,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585523577] [2022-12-13 11:47:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:18,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:47:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:18,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:47:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:47:18,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 65 [2022-12-13 11:47:18,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:18,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:18,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 65 [2022-12-13 11:47:18,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:23,170 INFO L130 PetriNetUnfolder]: 40551/58257 cut-off events. [2022-12-13 11:47:23,170 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-13 11:47:23,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112177 conditions, 58257 events. 40551/58257 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 445016 event pairs, 5311 based on Foata normal form. 0/35850 useless extension candidates. Maximal degree in co-relation 112165. Up to 46041 conditions per place. [2022-12-13 11:47:23,346 INFO L137 encePairwiseOnDemand]: 60/65 looper letters, 37 selfloop transitions, 2 changer transitions 46/98 dead transitions. [2022-12-13 11:47:23,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 378 flow [2022-12-13 11:47:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:47:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:47:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-12-13 11:47:23,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2022-12-13 11:47:23,357 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 142 flow. Second operand 3 states and 129 transitions. [2022-12-13 11:47:23,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 378 flow [2022-12-13 11:47:23,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 374 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:47:23,364 INFO L231 Difference]: Finished difference. Result has 73 places, 39 transitions, 90 flow [2022-12-13 11:47:23,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=73, PETRI_TRANSITIONS=39} [2022-12-13 11:47:23,368 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2022-12-13 11:47:23,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:23,369 INFO L89 Accepts]: Start accepts. Operand has 73 places, 39 transitions, 90 flow [2022-12-13 11:47:23,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:23,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:23,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 39 transitions, 90 flow [2022-12-13 11:47:23,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 90 flow [2022-12-13 11:47:23,381 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-13 11:47:23,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:47:23,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 90 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:47:23,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 90 flow [2022-12-13 11:47:23,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-13 11:47:23,507 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:47:23,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 11:47:23,510 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 90 flow [2022-12-13 11:47:23,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:23,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:23,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:23,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:47:23,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:23,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 361747423, now seen corresponding path program 1 times [2022-12-13 11:47:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:23,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753449896] [2022-12-13 11:47:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753449896] [2022-12-13 11:47:23,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753449896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:23,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:23,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:47:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063735944] [2022-12-13 11:47:23,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:23,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:47:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:47:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:47:23,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:47:23,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:23,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:23,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:47:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:24,812 INFO L130 PetriNetUnfolder]: 14000/19599 cut-off events. [2022-12-13 11:47:24,812 INFO L131 PetriNetUnfolder]: For 609/609 co-relation queries the response was YES. [2022-12-13 11:47:24,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39202 conditions, 19599 events. 14000/19599 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 107366 event pairs, 6608 based on Foata normal form. 0/15318 useless extension candidates. Maximal degree in co-relation 39192. Up to 18431 conditions per place. [2022-12-13 11:47:24,916 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 40 selfloop transitions, 5 changer transitions 2/56 dead transitions. [2022-12-13 11:47:24,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 226 flow [2022-12-13 11:47:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:47:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:47:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 11:47:24,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2022-12-13 11:47:24,917 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 90 flow. Second operand 3 states and 75 transitions. [2022-12-13 11:47:24,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 226 flow [2022-12-13 11:47:24,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:47:24,920 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 117 flow [2022-12-13 11:47:24,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 11:47:24,921 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -26 predicate places. [2022-12-13 11:47:24,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:24,921 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 117 flow [2022-12-13 11:47:24,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:24,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:24,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 117 flow [2022-12-13 11:47:24,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 117 flow [2022-12-13 11:47:24,934 INFO L130 PetriNetUnfolder]: 45/194 cut-off events. [2022-12-13 11:47:24,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:47:24,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 194 events. 45/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1006 event pairs, 23 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 277. Up to 76 conditions per place. [2022-12-13 11:47:24,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 117 flow [2022-12-13 11:47:24,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-13 11:47:24,980 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:47:24,981 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 11:47:24,982 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 117 flow [2022-12-13 11:47:24,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:24,982 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:24,982 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:24,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:47:24,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:24,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 750592509, now seen corresponding path program 1 times [2022-12-13 11:47:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:24,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668721972] [2022-12-13 11:47:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668721972] [2022-12-13 11:47:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668721972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:47:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572138094] [2022-12-13 11:47:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:25,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:25,182 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:47:25,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:25,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:25,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:47:25,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:26,112 INFO L130 PetriNetUnfolder]: 10364/14578 cut-off events. [2022-12-13 11:47:26,112 INFO L131 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2022-12-13 11:47:26,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32072 conditions, 14578 events. 10364/14578 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 75772 event pairs, 2892 based on Foata normal form. 234/12190 useless extension candidates. Maximal degree in co-relation 32061. Up to 10251 conditions per place. [2022-12-13 11:47:26,189 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2022-12-13 11:47:26,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 245 flow [2022-12-13 11:47:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:47:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:47:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 11:47:26,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2022-12-13 11:47:26,191 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 117 flow. Second operand 3 states and 71 transitions. [2022-12-13 11:47:26,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 245 flow [2022-12-13 11:47:26,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:47:26,193 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 123 flow [2022-12-13 11:47:26,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-12-13 11:47:26,194 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -25 predicate places. [2022-12-13 11:47:26,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:26,194 INFO L89 Accepts]: Start accepts. Operand has 52 places, 42 transitions, 123 flow [2022-12-13 11:47:26,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:26,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:26,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 123 flow [2022-12-13 11:47:26,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 123 flow [2022-12-13 11:47:26,206 INFO L130 PetriNetUnfolder]: 29/124 cut-off events. [2022-12-13 11:47:26,206 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 11:47:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 124 events. 29/124 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 564 event pairs, 11 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 204. Up to 53 conditions per place. [2022-12-13 11:47:26,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 123 flow [2022-12-13 11:47:26,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-13 11:47:26,210 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:47:26,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:47:26,210 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 123 flow [2022-12-13 11:47:26,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:26,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:26,211 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:47:26,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -254407079, now seen corresponding path program 1 times [2022-12-13 11:47:26,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:26,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973492901] [2022-12-13 11:47:26,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:26,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973492901] [2022-12-13 11:47:26,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973492901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:26,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:26,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:47:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831943900] [2022-12-13 11:47:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:26,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:26,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:26,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:47:26,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:26,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:26,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:47:26,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:28,066 INFO L130 PetriNetUnfolder]: 19840/27139 cut-off events. [2022-12-13 11:47:28,066 INFO L131 PetriNetUnfolder]: For 6057/6057 co-relation queries the response was YES. [2022-12-13 11:47:28,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60772 conditions, 27139 events. 19840/27139 cut-off events. For 6057/6057 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 161542 event pairs, 6432 based on Foata normal form. 1480/18227 useless extension candidates. Maximal degree in co-relation 60759. Up to 21286 conditions per place. [2022-12-13 11:47:28,246 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 69 selfloop transitions, 23 changer transitions 6/108 dead transitions. [2022-12-13 11:47:28,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 108 transitions, 485 flow [2022-12-13 11:47:28,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:47:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:47:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2022-12-13 11:47:28,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7157894736842105 [2022-12-13 11:47:28,247 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 123 flow. Second operand 5 states and 136 transitions. [2022-12-13 11:47:28,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 108 transitions, 485 flow [2022-12-13 11:47:28,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 108 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:47:28,255 INFO L231 Difference]: Finished difference. Result has 57 places, 64 transitions, 294 flow [2022-12-13 11:47:28,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=57, PETRI_TRANSITIONS=64} [2022-12-13 11:47:28,255 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -20 predicate places. [2022-12-13 11:47:28,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:28,256 INFO L89 Accepts]: Start accepts. Operand has 57 places, 64 transitions, 294 flow [2022-12-13 11:47:28,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:28,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:28,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 64 transitions, 294 flow [2022-12-13 11:47:28,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 64 transitions, 294 flow [2022-12-13 11:47:28,655 INFO L130 PetriNetUnfolder]: 4751/7153 cut-off events. [2022-12-13 11:47:28,655 INFO L131 PetriNetUnfolder]: For 1665/2501 co-relation queries the response was YES. [2022-12-13 11:47:28,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20754 conditions, 7153 events. 4751/7153 cut-off events. For 1665/2501 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 49601 event pairs, 2661 based on Foata normal form. 1/3047 useless extension candidates. Maximal degree in co-relation 20741. Up to 6095 conditions per place. [2022-12-13 11:47:28,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 64 transitions, 294 flow [2022-12-13 11:47:28,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 1310 [2022-12-13 11:47:29,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:29,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1243 [2022-12-13 11:47:29,498 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 288 flow [2022-12-13 11:47:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:29,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:29,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:29,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:47:29,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -813782496, now seen corresponding path program 1 times [2022-12-13 11:47:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:29,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706909270] [2022-12-13 11:47:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:29,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706909270] [2022-12-13 11:47:29,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706909270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:29,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:29,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745170829] [2022-12-13 11:47:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:47:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:47:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:47:29,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:47:29,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:29,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:29,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:47:29,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:30,981 INFO L130 PetriNetUnfolder]: 14696/20854 cut-off events. [2022-12-13 11:47:30,982 INFO L131 PetriNetUnfolder]: For 8597/8684 co-relation queries the response was YES. [2022-12-13 11:47:31,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72247 conditions, 20854 events. 14696/20854 cut-off events. For 8597/8684 co-relation queries the response was YES. Maximal size of possible extension queue 1170. Compared 128797 event pairs, 1985 based on Foata normal form. 1397/14369 useless extension candidates. Maximal degree in co-relation 72231. Up to 14032 conditions per place. [2022-12-13 11:47:31,129 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 78 selfloop transitions, 35 changer transitions 6/129 dead transitions. [2022-12-13 11:47:31,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 129 transitions, 798 flow [2022-12-13 11:47:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2022-12-13 11:47:31,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7324561403508771 [2022-12-13 11:47:31,131 INFO L175 Difference]: Start difference. First operand has 57 places, 63 transitions, 288 flow. Second operand 6 states and 167 transitions. [2022-12-13 11:47:31,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 129 transitions, 798 flow [2022-12-13 11:47:31,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 783 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:47:31,608 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 517 flow [2022-12-13 11:47:31,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=517, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2022-12-13 11:47:31,609 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -16 predicate places. [2022-12-13 11:47:31,609 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:31,609 INFO L89 Accepts]: Start accepts. Operand has 61 places, 76 transitions, 517 flow [2022-12-13 11:47:31,610 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:31,610 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:31,610 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 76 transitions, 517 flow [2022-12-13 11:47:31,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 76 transitions, 517 flow [2022-12-13 11:47:31,871 INFO L130 PetriNetUnfolder]: 3770/5997 cut-off events. [2022-12-13 11:47:31,871 INFO L131 PetriNetUnfolder]: For 4023/5874 co-relation queries the response was YES. [2022-12-13 11:47:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27630 conditions, 5997 events. 3770/5997 cut-off events. For 4023/5874 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 41913 event pairs, 1059 based on Foata normal form. 11/2639 useless extension candidates. Maximal degree in co-relation 27614. Up to 5194 conditions per place. [2022-12-13 11:47:31,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 76 transitions, 517 flow [2022-12-13 11:47:31,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 1614 [2022-12-13 11:47:32,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:32,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1197 [2022-12-13 11:47:32,806 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 75 transitions, 509 flow [2022-12-13 11:47:32,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:32,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:32,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:47:32,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1218489712, now seen corresponding path program 1 times [2022-12-13 11:47:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:32,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605817502] [2022-12-13 11:47:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605817502] [2022-12-13 11:47:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605817502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:32,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:32,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:47:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140156267] [2022-12-13 11:47:32,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:32,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:47:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:47:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:47:32,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 38 [2022-12-13 11:47:32,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:32,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:32,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 38 [2022-12-13 11:47:32,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:33,885 INFO L130 PetriNetUnfolder]: 8276/12511 cut-off events. [2022-12-13 11:47:33,886 INFO L131 PetriNetUnfolder]: For 10185/10401 co-relation queries the response was YES. [2022-12-13 11:47:33,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57070 conditions, 12511 events. 8276/12511 cut-off events. For 10185/10401 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 80243 event pairs, 503 based on Foata normal form. 1027/8815 useless extension candidates. Maximal degree in co-relation 57051. Up to 7816 conditions per place. [2022-12-13 11:47:33,954 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 72 selfloop transitions, 47 changer transitions 21/150 dead transitions. [2022-12-13 11:47:33,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 150 transitions, 1196 flow [2022-12-13 11:47:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:47:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:47:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2022-12-13 11:47:33,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2022-12-13 11:47:33,956 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 509 flow. Second operand 7 states and 196 transitions. [2022-12-13 11:47:33,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 150 transitions, 1196 flow [2022-12-13 11:47:34,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 150 transitions, 1022 flow, removed 74 selfloop flow, removed 4 redundant places. [2022-12-13 11:47:34,377 INFO L231 Difference]: Finished difference. Result has 64 places, 88 transitions, 665 flow [2022-12-13 11:47:34,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=665, PETRI_PLACES=64, PETRI_TRANSITIONS=88} [2022-12-13 11:47:34,378 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -13 predicate places. [2022-12-13 11:47:34,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:34,378 INFO L89 Accepts]: Start accepts. Operand has 64 places, 88 transitions, 665 flow [2022-12-13 11:47:34,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:34,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:34,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 88 transitions, 665 flow [2022-12-13 11:47:34,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 88 transitions, 665 flow [2022-12-13 11:47:34,541 INFO L130 PetriNetUnfolder]: 1763/3504 cut-off events. [2022-12-13 11:47:34,541 INFO L131 PetriNetUnfolder]: For 3996/4320 co-relation queries the response was YES. [2022-12-13 11:47:34,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16858 conditions, 3504 events. 1763/3504 cut-off events. For 3996/4320 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 28554 event pairs, 222 based on Foata normal form. 1/1757 useless extension candidates. Maximal degree in co-relation 16841. Up to 2863 conditions per place. [2022-12-13 11:47:34,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 88 transitions, 665 flow [2022-12-13 11:47:34,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 1638 [2022-12-13 11:47:34,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [387] L773-->L778: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:47:34,605 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [449] L801-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P2Thread1of1ForFork3_#res.offset_13| 0) (= |v_P2Thread1of1ForFork3_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_13|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_13|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-13 11:47:34,632 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [417] L849-->P3FINAL: Formula: (and (= |v_P3Thread1of1ForFork1_#res#1.offset_5| 0) (= |v_P3Thread1of1ForFork1_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P3Thread1of1ForFork1_#res#1.offset=|v_P3Thread1of1ForFork1_#res#1.offset_5|, P3Thread1of1ForFork1_#res#1.base=|v_P3Thread1of1ForFork1_#res#1.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res#1.offset, P3Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 11:47:34,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [440] L773-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 11:47:34,685 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [545] L849-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res#1.offset_33| 0) (= v_~__unbuffered_cnt~0_273 (+ v_~__unbuffered_cnt~0_274 1)) (= |v_P3Thread1of1ForFork1_#res#1.base_33| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_274} OutVars{P3Thread1of1ForFork1_#res#1.offset=|v_P3Thread1of1ForFork1_#res#1.offset_33|, P3Thread1of1ForFork1_#res#1.base=|v_P3Thread1of1ForFork1_#res#1.base_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_273} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res#1.offset, P3Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 11:47:34,709 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [441] L773-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-13 11:47:34,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [442] L801-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_5| 0) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] [2022-12-13 11:47:34,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [393] L801-->L806: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:47:34,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] L873-3-->L877: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_80) (= (mod v_~main$tmp_guard0~0_80 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_80, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [402] L849-->L852: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:47:34,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:34,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 504 [2022-12-13 11:47:34,882 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 87 transitions, 691 flow [2022-12-13 11:47:34,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:34,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:34,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:34,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:47:34,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:34,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1783220853, now seen corresponding path program 1 times [2022-12-13 11:47:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:34,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738174230] [2022-12-13 11:47:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:34,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:35,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738174230] [2022-12-13 11:47:35,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738174230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:35,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:35,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:47:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057579237] [2022-12-13 11:47:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:35,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 47 [2022-12-13 11:47:35,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 87 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:35,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:35,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 47 [2022-12-13 11:47:35,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:36,212 INFO L130 PetriNetUnfolder]: 9463/15286 cut-off events. [2022-12-13 11:47:36,212 INFO L131 PetriNetUnfolder]: For 35042/36527 co-relation queries the response was YES. [2022-12-13 11:47:36,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75320 conditions, 15286 events. 9463/15286 cut-off events. For 35042/36527 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 110031 event pairs, 1049 based on Foata normal form. 770/12265 useless extension candidates. Maximal degree in co-relation 75300. Up to 9256 conditions per place. [2022-12-13 11:47:36,305 INFO L137 encePairwiseOnDemand]: 44/47 looper letters, 135 selfloop transitions, 3 changer transitions 12/174 dead transitions. [2022-12-13 11:47:36,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 174 transitions, 1770 flow [2022-12-13 11:47:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:47:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:47:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-12-13 11:47:36,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6914893617021277 [2022-12-13 11:47:36,307 INFO L175 Difference]: Start difference. First operand has 63 places, 87 transitions, 691 flow. Second operand 4 states and 130 transitions. [2022-12-13 11:47:36,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 174 transitions, 1770 flow [2022-12-13 11:47:37,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 174 transitions, 1327 flow, removed 182 selfloop flow, removed 3 redundant places. [2022-12-13 11:47:37,577 INFO L231 Difference]: Finished difference. Result has 65 places, 89 transitions, 527 flow [2022-12-13 11:47:37,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=65, PETRI_TRANSITIONS=89} [2022-12-13 11:47:37,577 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2022-12-13 11:47:37,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:37,578 INFO L89 Accepts]: Start accepts. Operand has 65 places, 89 transitions, 527 flow [2022-12-13 11:47:37,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:37,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:37,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 89 transitions, 527 flow [2022-12-13 11:47:37,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 89 transitions, 527 flow [2022-12-13 11:47:37,933 INFO L130 PetriNetUnfolder]: 3283/6096 cut-off events. [2022-12-13 11:47:37,933 INFO L131 PetriNetUnfolder]: For 7153/7177 co-relation queries the response was YES. [2022-12-13 11:47:37,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24259 conditions, 6096 events. 3283/6096 cut-off events. For 7153/7177 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 50533 event pairs, 360 based on Foata normal form. 1/2768 useless extension candidates. Maximal degree in co-relation 24241. Up to 3304 conditions per place. [2022-12-13 11:47:37,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 89 transitions, 527 flow [2022-12-13 11:47:37,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 1662 [2022-12-13 11:47:38,044 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [496] $Ultimate##0-->L785: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_5| v_P2Thread1of1ForFork3_~arg.offset_5) (= v_P2Thread1of1ForFork3_~arg.base_5 |v_P2Thread1of1ForFork3_#in~arg.base_5|) (= v_~y~0_14 1)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_5|, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_5, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_5|, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_5, ~y~0=v_~y~0_14, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3_~arg.offset, ~y~0] and [386] L770-->L773: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 11:47:38,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:38,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 556 [2022-12-13 11:47:38,133 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 89 transitions, 530 flow [2022-12-13 11:47:38,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:38,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:38,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:38,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:47:38,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash -899408284, now seen corresponding path program 1 times [2022-12-13 11:47:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:38,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178723987] [2022-12-13 11:47:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:38,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:38,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178723987] [2022-12-13 11:47:38,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178723987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:38,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:38,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:47:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768459784] [2022-12-13 11:47:38,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:47:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:47:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:47:38,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 48 [2022-12-13 11:47:38,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 89 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:38,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:38,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 48 [2022-12-13 11:47:38,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:39,209 INFO L130 PetriNetUnfolder]: 8421/13496 cut-off events. [2022-12-13 11:47:39,209 INFO L131 PetriNetUnfolder]: For 10687/10798 co-relation queries the response was YES. [2022-12-13 11:47:39,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53450 conditions, 13496 events. 8421/13496 cut-off events. For 10687/10798 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 93559 event pairs, 218 based on Foata normal form. 799/8620 useless extension candidates. Maximal degree in co-relation 53429. Up to 4942 conditions per place. [2022-12-13 11:47:39,281 INFO L137 encePairwiseOnDemand]: 24/48 looper letters, 51 selfloop transitions, 59 changer transitions 22/142 dead transitions. [2022-12-13 11:47:39,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 142 transitions, 1044 flow [2022-12-13 11:47:39,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:47:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:47:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2022-12-13 11:47:39,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2022-12-13 11:47:39,283 INFO L175 Difference]: Start difference. First operand has 65 places, 89 transitions, 530 flow. Second operand 8 states and 195 transitions. [2022-12-13 11:47:39,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 142 transitions, 1044 flow [2022-12-13 11:47:39,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 142 transitions, 979 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 11:47:39,591 INFO L231 Difference]: Finished difference. Result has 73 places, 87 transitions, 642 flow [2022-12-13 11:47:39,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=73, PETRI_TRANSITIONS=87} [2022-12-13 11:47:39,592 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -4 predicate places. [2022-12-13 11:47:39,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:39,592 INFO L89 Accepts]: Start accepts. Operand has 73 places, 87 transitions, 642 flow [2022-12-13 11:47:39,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:39,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:39,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 87 transitions, 642 flow [2022-12-13 11:47:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 87 transitions, 642 flow [2022-12-13 11:47:39,692 INFO L130 PetriNetUnfolder]: 1028/2154 cut-off events. [2022-12-13 11:47:39,693 INFO L131 PetriNetUnfolder]: For 3568/4030 co-relation queries the response was YES. [2022-12-13 11:47:39,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9979 conditions, 2154 events. 1028/2154 cut-off events. For 3568/4030 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 16243 event pairs, 4 based on Foata normal form. 1/956 useless extension candidates. Maximal degree in co-relation 9958. Up to 1351 conditions per place. [2022-12-13 11:47:39,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 87 transitions, 642 flow [2022-12-13 11:47:39,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 1476 [2022-12-13 11:47:40,336 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:47:40,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 745 [2022-12-13 11:47:40,337 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 525 flow [2022-12-13 11:47:40,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:40,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:40,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:40,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:47:40,338 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2089440512, now seen corresponding path program 1 times [2022-12-13 11:47:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:40,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791332067] [2022-12-13 11:47:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:40,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:40,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791332067] [2022-12-13 11:47:40,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791332067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:40,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:40,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:47:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851739661] [2022-12-13 11:47:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:40,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:40,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2022-12-13 11:47:40,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:40,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:40,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2022-12-13 11:47:40,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:41,003 INFO L130 PetriNetUnfolder]: 4244/6638 cut-off events. [2022-12-13 11:47:41,003 INFO L131 PetriNetUnfolder]: For 16464/17418 co-relation queries the response was YES. [2022-12-13 11:47:41,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29350 conditions, 6638 events. 4244/6638 cut-off events. For 16464/17418 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 41629 event pairs, 319 based on Foata normal form. 344/5170 useless extension candidates. Maximal degree in co-relation 29326. Up to 3057 conditions per place. [2022-12-13 11:47:41,029 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 83 selfloop transitions, 2 changer transitions 30/140 dead transitions. [2022-12-13 11:47:41,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 140 transitions, 1229 flow [2022-12-13 11:47:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:47:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:47:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 11:47:41,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 11:47:41,030 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 525 flow. Second operand 4 states and 98 transitions. [2022-12-13 11:47:41,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 140 transitions, 1229 flow [2022-12-13 11:47:41,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 140 transitions, 918 flow, removed 66 selfloop flow, removed 10 redundant places. [2022-12-13 11:47:41,226 INFO L231 Difference]: Finished difference. Result has 61 places, 75 transitions, 367 flow [2022-12-13 11:47:41,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=61, PETRI_TRANSITIONS=75} [2022-12-13 11:47:41,227 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -16 predicate places. [2022-12-13 11:47:41,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:41,227 INFO L89 Accepts]: Start accepts. Operand has 61 places, 75 transitions, 367 flow [2022-12-13 11:47:41,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:41,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:41,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 75 transitions, 367 flow [2022-12-13 11:47:41,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 75 transitions, 367 flow [2022-12-13 11:47:41,306 INFO L130 PetriNetUnfolder]: 1454/2406 cut-off events. [2022-12-13 11:47:41,306 INFO L131 PetriNetUnfolder]: For 1391/1406 co-relation queries the response was YES. [2022-12-13 11:47:41,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2406 events. 1454/2406 cut-off events. For 1391/1406 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 14691 event pairs, 6 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 6753. Up to 1135 conditions per place. [2022-12-13 11:47:41,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 75 transitions, 367 flow [2022-12-13 11:47:41,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 1226 [2022-12-13 11:47:41,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:41,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 11:47:41,340 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 75 transitions, 370 flow [2022-12-13 11:47:41,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:41,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:41,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:41,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:47:41,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -441580344, now seen corresponding path program 1 times [2022-12-13 11:47:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:41,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765291554] [2022-12-13 11:47:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:41,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765291554] [2022-12-13 11:47:41,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765291554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:41,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:41,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:47:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292667510] [2022-12-13 11:47:41,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:41,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:41,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2022-12-13 11:47:41,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:41,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:41,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2022-12-13 11:47:41,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:42,060 INFO L130 PetriNetUnfolder]: 6959/10746 cut-off events. [2022-12-13 11:47:42,061 INFO L131 PetriNetUnfolder]: For 11601/12293 co-relation queries the response was YES. [2022-12-13 11:47:42,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36520 conditions, 10746 events. 6959/10746 cut-off events. For 11601/12293 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 70235 event pairs, 823 based on Foata normal form. 395/8127 useless extension candidates. Maximal degree in co-relation 36501. Up to 4378 conditions per place. [2022-12-13 11:47:42,100 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 57 selfloop transitions, 1 changer transitions 66/145 dead transitions. [2022-12-13 11:47:42,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 145 transitions, 966 flow [2022-12-13 11:47:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:47:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:47:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-12-13 11:47:42,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2022-12-13 11:47:42,102 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 370 flow. Second operand 4 states and 103 transitions. [2022-12-13 11:47:42,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 145 transitions, 966 flow [2022-12-13 11:47:42,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 145 transitions, 962 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:47:42,791 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 351 flow [2022-12-13 11:47:42,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2022-12-13 11:47:42,791 INFO L295 CegarLoopForPetriNet]: 77 programPoint places, -12 predicate places. [2022-12-13 11:47:42,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:42,791 INFO L89 Accepts]: Start accepts. Operand has 65 places, 69 transitions, 351 flow [2022-12-13 11:47:42,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:42,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:42,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 69 transitions, 351 flow [2022-12-13 11:47:42,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 69 transitions, 351 flow [2022-12-13 11:47:42,842 INFO L130 PetriNetUnfolder]: 767/1330 cut-off events. [2022-12-13 11:47:42,842 INFO L131 PetriNetUnfolder]: For 1526/1535 co-relation queries the response was YES. [2022-12-13 11:47:42,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 1330 events. 767/1330 cut-off events. For 1526/1535 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 7772 event pairs, 2 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 3960. Up to 649 conditions per place. [2022-12-13 11:47:42,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 69 transitions, 351 flow [2022-12-13 11:47:42,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 11:47:43,463 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:47:43,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 674 [2022-12-13 11:47:43,465 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 65 transitions, 343 flow [2022-12-13 11:47:43,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:43,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:43,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:47:43,466 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash -804155819, now seen corresponding path program 1 times [2022-12-13 11:47:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:43,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880903062] [2022-12-13 11:47:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:47:43,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:47:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:47:43,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:47:43,561 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:47:43,561 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:47:43,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:47:43,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:47:43,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:47:43,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:47:43,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:47:43,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:47:43,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:47:43,566 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:43,572 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:47:43,572 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:47:43,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:47:43 BasicIcfg [2022-12-13 11:47:43,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:47:43,632 INFO L158 Benchmark]: Toolchain (without parser) took 31206.74ms. Allocated memory was 182.5MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 144.8MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-12-13 11:47:43,632 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:47:43,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.74ms. Allocated memory is still 182.5MB. Free memory was 144.8MB in the beginning and 116.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:47:43,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.01ms. Allocated memory is still 182.5MB. Free memory was 116.5MB in the beginning and 113.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:47:43,633 INFO L158 Benchmark]: Boogie Preprocessor took 40.12ms. Allocated memory is still 182.5MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:47:43,633 INFO L158 Benchmark]: RCFGBuilder took 596.11ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 74.6MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-13 11:47:43,633 INFO L158 Benchmark]: TraceAbstraction took 29991.62ms. Allocated memory was 182.5MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 73.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 11:47:43,634 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.09ms. Allocated memory is still 182.5MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.74ms. Allocated memory is still 182.5MB. Free memory was 144.8MB in the beginning and 116.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.01ms. Allocated memory is still 182.5MB. Free memory was 116.5MB in the beginning and 113.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.12ms. Allocated memory is still 182.5MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.11ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 74.6MB in the end (delta: 37.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 29991.62ms. Allocated memory was 182.5MB in the beginning and 5.0GB in the end (delta: 4.8GB). Free memory was 73.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 136 PlacesBefore, 77 PlacesAfterwards, 125 TransitionsBefore, 65 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4794, independent: 4650, independent conditional: 4650, independent unconditional: 0, dependent: 144, dependent conditional: 144, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4794, independent: 4650, independent conditional: 0, independent unconditional: 4650, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4794, independent: 4650, independent conditional: 0, independent unconditional: 4650, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4794, independent: 4650, independent conditional: 0, independent unconditional: 4650, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2574, independent: 2521, independent conditional: 0, independent unconditional: 2521, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2574, independent: 2495, independent conditional: 0, independent unconditional: 2495, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4794, independent: 2129, independent conditional: 0, independent unconditional: 2129, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 2574, unknown conditional: 0, unknown unconditional: 2574] , Statistics on independence cache: Total cache size (in pairs): 4866, Positive cache size: 4813, Positive conditional cache size: 0, Positive unconditional cache size: 4813, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 518, independent: 476, independent conditional: 476, 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: 518, independent: 476, independent conditional: 17, independent unconditional: 459, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 518, independent: 476, independent conditional: 17, independent unconditional: 459, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 518, independent: 476, independent conditional: 17, independent unconditional: 459, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 376, independent: 347, independent conditional: 17, independent unconditional: 330, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 376, independent: 293, independent conditional: 0, independent unconditional: 293, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 72, dependent conditional: 14, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 518, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 376, unknown conditional: 19, unknown unconditional: 357] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 347, Positive conditional cache size: 17, Positive unconditional cache size: 330, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 928 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 229, independent: 210, independent conditional: 17, independent unconditional: 193, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 373, Positive conditional cache size: 17, Positive unconditional cache size: 356, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 189, independent: 169, independent conditional: 13, independent unconditional: 156, dependent: 20, dependent conditional: 6, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 377, Positive conditional cache size: 17, Positive unconditional cache size: 360, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 57 PlacesBefore, 57 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 828, independent: 788, independent conditional: 788, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 828, independent: 788, independent conditional: 320, independent unconditional: 468, dependent: 40, dependent conditional: 12, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 828, independent: 788, independent conditional: 296, independent unconditional: 492, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 828, independent: 788, independent conditional: 296, independent unconditional: 492, dependent: 40, dependent conditional: 0, dependent unconditional: 40, 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: 828, independent: 780, independent conditional: 288, independent unconditional: 492, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 385, Positive conditional cache size: 25, Positive unconditional cache size: 360, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 61 PlacesBefore, 61 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 1614 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 308, independent: 262, independent conditional: 262, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 308, independent: 262, independent conditional: 122, independent unconditional: 140, dependent: 46, dependent conditional: 12, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, independent: 262, independent conditional: 98, independent unconditional: 164, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 308, independent: 262, independent conditional: 98, independent unconditional: 164, dependent: 46, dependent conditional: 0, dependent unconditional: 46, 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: 308, independent: 254, independent conditional: 90, independent unconditional: 164, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 393, Positive conditional cache size: 33, Positive unconditional cache size: 360, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 64 PlacesBefore, 63 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 1638 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 906, independent: 842, independent conditional: 842, 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: 906, independent: 842, independent conditional: 456, independent unconditional: 386, dependent: 64, dependent conditional: 12, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 906, independent: 842, independent conditional: 432, independent unconditional: 410, 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: 906, independent: 842, independent conditional: 432, independent unconditional: 410, 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: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 906, independent: 834, independent conditional: 424, independent unconditional: 410, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 419, Positive conditional cache size: 41, Positive unconditional cache size: 378, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 688, independent: 619, independent conditional: 619, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 688, independent: 619, independent conditional: 311, independent unconditional: 308, dependent: 69, dependent conditional: 11, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 688, independent: 619, independent conditional: 285, independent unconditional: 334, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 688, independent: 619, independent conditional: 285, independent unconditional: 334, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 30, independent conditional: 18, independent unconditional: 12, 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: 31, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 688, independent: 589, independent conditional: 267, independent unconditional: 322, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 31, unknown conditional: 18, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 469, Positive conditional cache size: 63, Positive unconditional cache size: 406, Negative cache size: 35, Negative conditional cache size: 2, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 37, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 71 PlacesBefore, 66 PlacesAfterwards, 87 TransitionsBefore, 74 TransitionsAfterwards, 1476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 894, independent: 849, independent conditional: 849, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 894, independent: 849, independent conditional: 515, independent unconditional: 334, dependent: 45, dependent conditional: 4, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 894, independent: 849, independent conditional: 497, independent unconditional: 352, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 894, independent: 849, independent conditional: 497, independent unconditional: 352, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 98, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 98, independent: 95, independent conditional: 0, independent unconditional: 95, 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: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 894, independent: 754, independent conditional: 402, independent unconditional: 352, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 98, unknown conditional: 95, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 635, Positive cache size: 597, Positive conditional cache size: 161, Positive unconditional cache size: 436, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 519, independent: 483, independent conditional: 483, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 519, independent: 483, independent conditional: 233, independent unconditional: 250, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 519, independent: 483, independent conditional: 223, independent unconditional: 260, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 519, independent: 483, independent conditional: 223, independent unconditional: 260, dependent: 36, dependent conditional: 0, dependent unconditional: 36, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 519, independent: 482, independent conditional: 223, independent unconditional: 259, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 673, Positive cache size: 634, Positive conditional cache size: 171, Positive unconditional cache size: 463, Negative cache size: 39, Negative conditional cache size: 2, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 61 PlacesBefore, 57 PlacesAfterwards, 69 TransitionsBefore, 65 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 784, independent: 736, independent conditional: 736, 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: 784, independent: 736, independent conditional: 527, independent unconditional: 209, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 784, independent: 736, independent conditional: 525, independent unconditional: 211, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 784, independent: 736, independent conditional: 525, independent unconditional: 211, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 12, independent unconditional: 14, 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: 26, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 784, independent: 710, independent conditional: 513, independent unconditional: 197, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 26, unknown conditional: 12, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 745, Positive conditional cache size: 214, Positive unconditional cache size: 531, Negative cache size: 39, Negative conditional cache size: 2, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-2, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-1, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=1, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 867]: 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: 871]: 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: 873]: 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: 869]: 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 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1293 IncrementalHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 8 mSDtfsCounter, 1293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=691occurred in iteration=6, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:47:43,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...