/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:41:12,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:41:12,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:41:12,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:41:12,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:41:12,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:41:12,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:41:12,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:41:12,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:41:12,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:41:12,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:41:12,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:41:12,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:41:12,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:41:12,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:41:12,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:41:12,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:41:12,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:41:12,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:41:12,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:41:12,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:41:12,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:41:12,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:41:12,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:41:12,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:41:12,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:41:12,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:41:12,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:41:12,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:41:12,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:41:12,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:41:12,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:41:12,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:41:12,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:41:12,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:41:12,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:41:12,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:41:12,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:41:12,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:41:12,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:41:12,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:41:12,958 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-RepeatedSemanticLbe.epf [2022-12-13 00:41:12,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:41:12,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:41:12,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:41:12,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:41:12,995 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:41:12,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:41:12,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:41:12,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:41:12,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:41:12,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:41:12,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:41:12,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:41:12,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:41:12,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:41:12,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:41:12,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:41:12,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:41:12,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:41:12,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:41:12,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:41:12,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:41:13,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:41:13,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:41:13,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:41:13,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:41:13,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:41:13,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:41:13,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:41:13,005 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 00:41:13,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:41:13,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:41:13,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:41:13,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:41:13,271 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:41:13,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2022-12-13 00:41:14,197 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:41:14,438 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:41:14,438 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt_rmo.opt.i [2022-12-13 00:41:14,464 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57587c8e8/cd1e73fa8fa24f97924453f760f37de6/FLAG2cdcf105c [2022-12-13 00:41:14,475 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57587c8e8/cd1e73fa8fa24f97924453f760f37de6 [2022-12-13 00:41:14,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:41:14,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:41:14,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:41:14,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:41:14,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:41:14,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:14,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fb46ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14, skipping insertion in model container [2022-12-13 00:41:14,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:14,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:41:14,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:41:14,681 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/mix036_power.opt_rmo.opt.i[958,971] [2022-12-13 00:41:14,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:41:14,847 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:41:14,859 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/mix036_power.opt_rmo.opt.i[958,971] [2022-12-13 00:41:14,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:41:14,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:41:14,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:41:14,946 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:41:14,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14 WrapperNode [2022-12-13 00:41:14,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:41:14,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:41:14,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:41:14,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:41:14,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:14,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,014 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-13 00:41:15,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:41:15,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:41:15,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:41:15,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:41:15,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,053 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:41:15,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:41:15,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:41:15,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:41:15,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (1/1) ... [2022-12-13 00:41:15,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:41:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:41:15,094 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 00:41:15,111 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 00:41:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:41:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:41:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:41:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:41:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:41:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:41:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:41:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:41:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:41:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:41:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:41:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:41:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:41:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:41:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:41:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:41:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:41:15,144 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 00:41:15,323 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:41:15,324 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:41:15,563 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:41:15,658 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:41:15,658 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:41:15,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:15 BoogieIcfgContainer [2022-12-13 00:41:15,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:41:15,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:41:15,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:41:15,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:41:15,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:41:14" (1/3) ... [2022-12-13 00:41:15,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa347cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:15, skipping insertion in model container [2022-12-13 00:41:15,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:41:14" (2/3) ... [2022-12-13 00:41:15,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa347cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:41:15, skipping insertion in model container [2022-12-13 00:41:15,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:41:15" (3/3) ... [2022-12-13 00:41:15,673 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_power.opt_rmo.opt.i [2022-12-13 00:41:15,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:41:15,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:41:15,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:41:15,725 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:41:15,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-13 00:41:15,794 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 00:41:15,795 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:15,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 00:41:15,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-13 00:41:15,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-13 00:41:15,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:15,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-13 00:41:15,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-13 00:41:15,840 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-13 00:41:15,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 00:41:15,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-13 00:41:15,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 2954 [2022-12-13 00:41:19,889 INFO L241 LiptonReduction]: Total number of compositions: 100 [2022-12-13 00:41:19,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:41:19,906 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;@578cc5e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:41:19,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:41:19,909 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 00:41:19,909 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:19,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:19,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:19,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash -512014533, now seen corresponding path program 1 times [2022-12-13 00:41:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:19,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712881000] [2022-12-13 00:41:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:20,291 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 00:41:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:20,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712881000] [2022-12-13 00:41:20,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712881000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:20,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:20,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:41:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513594457] [2022-12-13 00:41:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:20,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:20,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 73 [2022-12-13 00:41:20,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 00:41:20,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:20,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 73 [2022-12-13 00:41:20,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:25,315 INFO L130 PetriNetUnfolder]: 50539/73567 cut-off events. [2022-12-13 00:41:25,315 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 00:41:25,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140611 conditions, 73567 events. 50539/73567 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 4032. Compared 585245 event pairs, 7571 based on Foata normal form. 0/44476 useless extension candidates. Maximal degree in co-relation 140599. Up to 55929 conditions per place. [2022-12-13 00:41:25,525 INFO L137 encePairwiseOnDemand]: 67/73 looper letters, 42 selfloop transitions, 2 changer transitions 53/112 dead transitions. [2022-12-13 00:41:25,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 112 transitions, 431 flow [2022-12-13 00:41:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-12-13 00:41:25,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6894977168949772 [2022-12-13 00:41:25,535 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 158 flow. Second operand 3 states and 151 transitions. [2022-12-13 00:41:25,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 112 transitions, 431 flow [2022-12-13 00:41:25,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 426 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:41:25,541 INFO L231 Difference]: Finished difference. Result has 80 places, 42 transitions, 96 flow [2022-12-13 00:41:25,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=80, PETRI_TRANSITIONS=42} [2022-12-13 00:41:25,546 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2022-12-13 00:41:25,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:25,547 INFO L89 Accepts]: Start accepts. Operand has 80 places, 42 transitions, 96 flow [2022-12-13 00:41:25,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:25,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:25,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 42 transitions, 96 flow [2022-12-13 00:41:25,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2022-12-13 00:41:25,568 INFO L130 PetriNetUnfolder]: 0/42 cut-off events. [2022-12-13 00:41:25,568 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:25,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:41:25,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2022-12-13 00:41:25,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 1048 [2022-12-13 00:41:25,750 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:25,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-13 00:41:25,752 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 96 flow [2022-12-13 00:41:25,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 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 00:41:25,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:25,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:41:25,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1634185313, now seen corresponding path program 1 times [2022-12-13 00:41:25,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:25,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145807150] [2022-12-13 00:41:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:25,979 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 00:41:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145807150] [2022-12-13 00:41:25,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145807150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:25,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:25,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:41:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847519315] [2022-12-13 00:41:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:25,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:25,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:25,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:41:25,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:25,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:25,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:41:25,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:27,822 INFO L130 PetriNetUnfolder]: 19373/26899 cut-off events. [2022-12-13 00:41:27,822 INFO L131 PetriNetUnfolder]: For 1034/1034 co-relation queries the response was YES. [2022-12-13 00:41:27,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54013 conditions, 26899 events. 19373/26899 cut-off events. For 1034/1034 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 151164 event pairs, 8981 based on Foata normal form. 0/20639 useless extension candidates. Maximal degree in co-relation 54003. Up to 25367 conditions per place. [2022-12-13 00:41:27,941 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 43 selfloop transitions, 5 changer transitions 2/60 dead transitions. [2022-12-13 00:41:27,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 240 flow [2022-12-13 00:41:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-13 00:41:27,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 00:41:27,944 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 96 flow. Second operand 3 states and 81 transitions. [2022-12-13 00:41:27,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 240 flow [2022-12-13 00:41:27,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:27,949 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 123 flow [2022-12-13 00:41:27,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-13 00:41:27,950 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -30 predicate places. [2022-12-13 00:41:27,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:27,950 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 123 flow [2022-12-13 00:41:27,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:27,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:27,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 123 flow [2022-12-13 00:41:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 123 flow [2022-12-13 00:41:27,969 INFO L130 PetriNetUnfolder]: 45/205 cut-off events. [2022-12-13 00:41:27,969 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:41:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 205 events. 45/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1079 event pairs, 23 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 288. Up to 76 conditions per place. [2022-12-13 00:41:27,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 123 flow [2022-12-13 00:41:27,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 1076 [2022-12-13 00:41:27,986 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:27,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 00:41:27,988 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 123 flow [2022-12-13 00:41:27,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:27,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:27,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:27,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:41:27,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -845347145, now seen corresponding path program 1 times [2022-12-13 00:41:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:27,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287498527] [2022-12-13 00:41:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:28,147 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 00:41:28,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:28,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287498527] [2022-12-13 00:41:28,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287498527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:28,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:28,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:41:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372581892] [2022-12-13 00:41:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:28,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:28,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:28,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-13 00:41:28,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 00:41:28,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:28,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-13 00:41:28,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:29,349 INFO L130 PetriNetUnfolder]: 13954/19467 cut-off events. [2022-12-13 00:41:29,349 INFO L131 PetriNetUnfolder]: For 3145/3145 co-relation queries the response was YES. [2022-12-13 00:41:29,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42522 conditions, 19467 events. 13954/19467 cut-off events. For 3145/3145 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 103311 event pairs, 4774 based on Foata normal form. 426/16186 useless extension candidates. Maximal degree in co-relation 42511. Up to 12401 conditions per place. [2022-12-13 00:41:29,470 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 46 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2022-12-13 00:41:29,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 259 flow [2022-12-13 00:41:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 00:41:29,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6260162601626016 [2022-12-13 00:41:29,472 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 123 flow. Second operand 3 states and 77 transitions. [2022-12-13 00:41:29,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 259 flow [2022-12-13 00:41:29,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:29,474 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 127 flow [2022-12-13 00:41:29,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 00:41:29,474 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2022-12-13 00:41:29,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:29,474 INFO L89 Accepts]: Start accepts. Operand has 55 places, 44 transitions, 127 flow [2022-12-13 00:41:29,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:29,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:29,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 127 flow [2022-12-13 00:41:29,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 127 flow [2022-12-13 00:41:29,487 INFO L130 PetriNetUnfolder]: 29/131 cut-off events. [2022-12-13 00:41:29,488 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-13 00:41:29,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 131 events. 29/131 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 605 event pairs, 11 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 211. Up to 53 conditions per place. [2022-12-13 00:41:29,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 127 flow [2022-12-13 00:41:29,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 00:41:29,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:29,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 00:41:29,515 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 127 flow [2022-12-13 00:41:29,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 00:41:29,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:29,516 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:29,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:41:29,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1438256413, now seen corresponding path program 1 times [2022-12-13 00:41:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575596361] [2022-12-13 00:41:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:29,657 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 00:41:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:29,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575596361] [2022-12-13 00:41:29,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575596361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:29,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:29,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:41:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2814517] [2022-12-13 00:41:29,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:29,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:41:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:29,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:41:29,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:41:29,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:41:29,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:29,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:29,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:41:29,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:31,133 INFO L130 PetriNetUnfolder]: 16974/23471 cut-off events. [2022-12-13 00:41:31,134 INFO L131 PetriNetUnfolder]: For 4092/4185 co-relation queries the response was YES. [2022-12-13 00:41:31,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51203 conditions, 23471 events. 16974/23471 cut-off events. For 4092/4185 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 134312 event pairs, 5515 based on Foata normal form. 91/15487 useless extension candidates. Maximal degree in co-relation 51190. Up to 22708 conditions per place. [2022-12-13 00:41:31,317 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 43 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2022-12-13 00:41:31,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 297 flow [2022-12-13 00:41:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 00:41:31,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2022-12-13 00:41:31,319 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 127 flow. Second operand 3 states and 86 transitions. [2022-12-13 00:41:31,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 297 flow [2022-12-13 00:41:31,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:31,322 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 210 flow [2022-12-13 00:41:31,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 00:41:31,323 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2022-12-13 00:41:31,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:31,324 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 210 flow [2022-12-13 00:41:31,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:31,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:31,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 210 flow [2022-12-13 00:41:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 210 flow [2022-12-13 00:41:31,567 INFO L130 PetriNetUnfolder]: 2789/4546 cut-off events. [2022-12-13 00:41:31,567 INFO L131 PetriNetUnfolder]: For 258/279 co-relation queries the response was YES. [2022-12-13 00:41:31,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9104 conditions, 4546 events. 2789/4546 cut-off events. For 258/279 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 33129 event pairs, 1482 based on Foata normal form. 0/2102 useless extension candidates. Maximal degree in co-relation 9093. Up to 3763 conditions per place. [2022-12-13 00:41:31,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 210 flow [2022-12-13 00:41:31,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 1244 [2022-12-13 00:41:31,676 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:31,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 354 [2022-12-13 00:41:31,677 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 210 flow [2022-12-13 00:41:31,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:31,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:31,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:31,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:41:31,677 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash -631193736, now seen corresponding path program 1 times [2022-12-13 00:41:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177939496] [2022-12-13 00:41:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:31,804 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 00:41:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177939496] [2022-12-13 00:41:31,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177939496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:31,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:31,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011788010] [2022-12-13 00:41:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:31,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:31,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:31,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:41:31,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:31,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:31,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:41:31,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:32,939 INFO L130 PetriNetUnfolder]: 11535/16862 cut-off events. [2022-12-13 00:41:32,940 INFO L131 PetriNetUnfolder]: For 3367/3394 co-relation queries the response was YES. [2022-12-13 00:41:32,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46620 conditions, 16862 events. 11535/16862 cut-off events. For 3367/3394 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 103159 event pairs, 1984 based on Foata normal form. 420/11655 useless extension candidates. Maximal degree in co-relation 46606. Up to 14365 conditions per place. [2022-12-13 00:41:33,014 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 54 selfloop transitions, 25 changer transitions 0/92 dead transitions. [2022-12-13 00:41:33,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 478 flow [2022-12-13 00:41:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-12-13 00:41:33,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.74375 [2022-12-13 00:41:33,015 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 210 flow. Second operand 4 states and 119 transitions. [2022-12-13 00:41:33,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 478 flow [2022-12-13 00:41:33,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:33,018 INFO L231 Difference]: Finished difference. Result has 58 places, 68 transitions, 345 flow [2022-12-13 00:41:33,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2022-12-13 00:41:33,018 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2022-12-13 00:41:33,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:33,019 INFO L89 Accepts]: Start accepts. Operand has 58 places, 68 transitions, 345 flow [2022-12-13 00:41:33,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:33,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:33,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 68 transitions, 345 flow [2022-12-13 00:41:33,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 68 transitions, 345 flow [2022-12-13 00:41:33,171 INFO L130 PetriNetUnfolder]: 2168/3763 cut-off events. [2022-12-13 00:41:33,171 INFO L131 PetriNetUnfolder]: For 417/2790 co-relation queries the response was YES. [2022-12-13 00:41:33,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10885 conditions, 3763 events. 2168/3763 cut-off events. For 417/2790 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 27878 event pairs, 627 based on Foata normal form. 11/1794 useless extension candidates. Maximal degree in co-relation 10872. Up to 3124 conditions per place. [2022-12-13 00:41:33,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 68 transitions, 345 flow [2022-12-13 00:41:33,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 1592 [2022-12-13 00:41:33,213 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:33,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-13 00:41:33,213 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 345 flow [2022-12-13 00:41:33,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:33,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:33,214 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 00:41:33,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:41:33,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -623362634, now seen corresponding path program 1 times [2022-12-13 00:41:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:33,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008978794] [2022-12-13 00:41:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:33,329 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 00:41:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:33,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008978794] [2022-12-13 00:41:33,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008978794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:33,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:33,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368198756] [2022-12-13 00:41:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:33,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:41:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:41:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:41:33,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 00:41:33,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 00:41:33,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:33,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 00:41:33,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:35,219 INFO L130 PetriNetUnfolder]: 19393/28732 cut-off events. [2022-12-13 00:41:35,219 INFO L131 PetriNetUnfolder]: For 17331/20235 co-relation queries the response was YES. [2022-12-13 00:41:35,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95725 conditions, 28732 events. 19393/28732 cut-off events. For 17331/20235 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 192509 event pairs, 3543 based on Foata normal form. 1390/24670 useless extension candidates. Maximal degree in co-relation 95709. Up to 16032 conditions per place. [2022-12-13 00:41:35,359 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 127 selfloop transitions, 11 changer transitions 4/160 dead transitions. [2022-12-13 00:41:35,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 160 transitions, 1060 flow [2022-12-13 00:41:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-12-13 00:41:35,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6625 [2022-12-13 00:41:35,361 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 345 flow. Second operand 6 states and 159 transitions. [2022-12-13 00:41:35,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 160 transitions, 1060 flow [2022-12-13 00:41:35,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 160 transitions, 954 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-13 00:41:35,368 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 347 flow [2022-12-13 00:41:35,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2022-12-13 00:41:35,368 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places. [2022-12-13 00:41:35,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:35,369 INFO L89 Accepts]: Start accepts. Operand has 63 places, 73 transitions, 347 flow [2022-12-13 00:41:35,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:35,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:35,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 73 transitions, 347 flow [2022-12-13 00:41:35,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 73 transitions, 347 flow [2022-12-13 00:41:35,644 INFO L130 PetriNetUnfolder]: 3979/6745 cut-off events. [2022-12-13 00:41:35,644 INFO L131 PetriNetUnfolder]: For 1527/3525 co-relation queries the response was YES. [2022-12-13 00:41:35,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18993 conditions, 6745 events. 3979/6745 cut-off events. For 1527/3525 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 53552 event pairs, 1127 based on Foata normal form. 18/3048 useless extension candidates. Maximal degree in co-relation 18978. Up to 5833 conditions per place. [2022-12-13 00:41:35,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 73 transitions, 347 flow [2022-12-13 00:41:35,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-13 00:41:35,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L772: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [364] L757-->L760: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-13 00:41:35,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L772: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [385] L833-->L836: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_1) InVars {~a~0=v_~a~0_1} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 00:41:35,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L772: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [377] L810-->L813: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:41:36,327 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:41:36,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 960 [2022-12-13 00:41:36,328 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 351 flow [2022-12-13 00:41:36,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 00:41:36,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:36,328 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 00:41:36,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:41:36,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash -531621452, now seen corresponding path program 1 times [2022-12-13 00:41:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:36,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137637987] [2022-12-13 00:41:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:36,495 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 00:41:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:36,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137637987] [2022-12-13 00:41:36,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137637987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:36,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:36,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085848411] [2022-12-13 00:41:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:36,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:41:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:41:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:41:36,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 00:41:36,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 00:41:36,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:36,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 00:41:36,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:37,769 INFO L130 PetriNetUnfolder]: 9778/15159 cut-off events. [2022-12-13 00:41:37,769 INFO L131 PetriNetUnfolder]: For 8279/8552 co-relation queries the response was YES. [2022-12-13 00:41:37,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49404 conditions, 15159 events. 9778/15159 cut-off events. For 8279/8552 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 102355 event pairs, 706 based on Foata normal form. 959/10277 useless extension candidates. Maximal degree in co-relation 49386. Up to 8299 conditions per place. [2022-12-13 00:41:37,849 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 65 selfloop transitions, 37 changer transitions 1/117 dead transitions. [2022-12-13 00:41:37,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 728 flow [2022-12-13 00:41:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:41:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:41:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2022-12-13 00:41:37,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 00:41:37,851 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 351 flow. Second operand 5 states and 154 transitions. [2022-12-13 00:41:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 728 flow [2022-12-13 00:41:37,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 117 transitions, 728 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:41:37,856 INFO L231 Difference]: Finished difference. Result has 67 places, 84 transitions, 547 flow [2022-12-13 00:41:37,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=547, PETRI_PLACES=67, PETRI_TRANSITIONS=84} [2022-12-13 00:41:37,857 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -17 predicate places. [2022-12-13 00:41:37,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:37,857 INFO L89 Accepts]: Start accepts. Operand has 67 places, 84 transitions, 547 flow [2022-12-13 00:41:37,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:37,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:37,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 84 transitions, 547 flow [2022-12-13 00:41:37,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 84 transitions, 547 flow [2022-12-13 00:41:38,111 INFO L130 PetriNetUnfolder]: 2189/4386 cut-off events. [2022-12-13 00:41:38,112 INFO L131 PetriNetUnfolder]: For 1943/3598 co-relation queries the response was YES. [2022-12-13 00:41:38,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16679 conditions, 4386 events. 2189/4386 cut-off events. For 1943/3598 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 37677 event pairs, 227 based on Foata normal form. 20/2191 useless extension candidates. Maximal degree in co-relation 16661. Up to 3565 conditions per place. [2022-12-13 00:41:38,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 84 transitions, 547 flow [2022-12-13 00:41:38,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 1694 [2022-12-13 00:41:38,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:38,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-13 00:41:38,237 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 84 transitions, 547 flow [2022-12-13 00:41:38,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 00:41:38,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:38,238 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] [2022-12-13 00:41:38,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:41:38,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash 783612552, now seen corresponding path program 1 times [2022-12-13 00:41:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:38,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885568409] [2022-12-13 00:41:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:38,408 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 00:41:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885568409] [2022-12-13 00:41:38,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885568409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:38,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:41:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296079368] [2022-12-13 00:41:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:38,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:41:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:38,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:41:38,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:41:38,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2022-12-13 00:41:38,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 84 transitions, 547 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 00:41:38,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:38,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2022-12-13 00:41:38,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:39,972 INFO L130 PetriNetUnfolder]: 13398/21894 cut-off events. [2022-12-13 00:41:39,972 INFO L131 PetriNetUnfolder]: For 31189/34410 co-relation queries the response was YES. [2022-12-13 00:41:40,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88343 conditions, 21894 events. 13398/21894 cut-off events. For 31189/34410 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 172017 event pairs, 1102 based on Foata normal form. 1323/18213 useless extension candidates. Maximal degree in co-relation 88322. Up to 13343 conditions per place. [2022-12-13 00:41:40,130 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 123 selfloop transitions, 2 changer transitions 6/160 dead transitions. [2022-12-13 00:41:40,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 160 transitions, 1319 flow [2022-12-13 00:41:40,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:41:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:41:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-12-13 00:41:40,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2022-12-13 00:41:40,131 INFO L175 Difference]: Start difference. First operand has 67 places, 84 transitions, 547 flow. Second operand 4 states and 124 transitions. [2022-12-13 00:41:40,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 160 transitions, 1319 flow [2022-12-13 00:41:40,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 160 transitions, 1098 flow, removed 52 selfloop flow, removed 4 redundant places. [2022-12-13 00:41:40,431 INFO L231 Difference]: Finished difference. Result has 68 places, 85 transitions, 454 flow [2022-12-13 00:41:40,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=68, PETRI_TRANSITIONS=85} [2022-12-13 00:41:40,431 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2022-12-13 00:41:40,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:40,431 INFO L89 Accepts]: Start accepts. Operand has 68 places, 85 transitions, 454 flow [2022-12-13 00:41:40,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:40,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:40,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 85 transitions, 454 flow [2022-12-13 00:41:40,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 85 transitions, 454 flow [2022-12-13 00:41:40,767 INFO L130 PetriNetUnfolder]: 4103/7893 cut-off events. [2022-12-13 00:41:40,767 INFO L131 PetriNetUnfolder]: For 5441/6205 co-relation queries the response was YES. [2022-12-13 00:41:40,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24548 conditions, 7893 events. 4103/7893 cut-off events. For 5441/6205 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 72281 event pairs, 363 based on Foata normal form. 29/3855 useless extension candidates. Maximal degree in co-relation 24530. Up to 5752 conditions per place. [2022-12-13 00:41:40,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 85 transitions, 454 flow [2022-12-13 00:41:40,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 1730 [2022-12-13 00:41:40,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [408] $Ultimate##0-->L757: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_~b~0_7 1) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] and [537] $Ultimate##0-->L760: Formula: (and (= v_~x~0_35 1) (= v_~x~0_35 v_~__unbuffered_p0_EAX~0_92) (= |v_P1Thread1of1ForFork0_#in~arg.offset_13| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_13|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_13|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_13|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_13|, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:41:40,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:40,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 527 [2022-12-13 00:41:40,958 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 85 transitions, 460 flow [2022-12-13 00:41:40,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 00:41:40,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:40,959 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] [2022-12-13 00:41:40,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:41:40,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1761415524, now seen corresponding path program 1 times [2022-12-13 00:41:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601172722] [2022-12-13 00:41:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:41,287 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 00:41:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601172722] [2022-12-13 00:41:41,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601172722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:41,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:41,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822563593] [2022-12-13 00:41:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:41,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:41:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:41:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:41:41,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2022-12-13 00:41:41,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 85 transitions, 460 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 00:41:41,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:41,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2022-12-13 00:41:41,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:43,958 INFO L130 PetriNetUnfolder]: 23480/37638 cut-off events. [2022-12-13 00:41:43,958 INFO L131 PetriNetUnfolder]: For 57004/61937 co-relation queries the response was YES. [2022-12-13 00:41:44,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134137 conditions, 37638 events. 23480/37638 cut-off events. For 57004/61937 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 304144 event pairs, 2281 based on Foata normal form. 2375/31850 useless extension candidates. Maximal degree in co-relation 134116. Up to 17448 conditions per place. [2022-12-13 00:41:44,144 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 112 selfloop transitions, 11 changer transitions 37/182 dead transitions. [2022-12-13 00:41:44,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 182 transitions, 1292 flow [2022-12-13 00:41:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:44,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-12-13 00:41:44,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-13 00:41:44,146 INFO L175 Difference]: Start difference. First operand has 68 places, 85 transitions, 460 flow. Second operand 6 states and 153 transitions. [2022-12-13 00:41:44,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 182 transitions, 1292 flow [2022-12-13 00:41:44,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 182 transitions, 1283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:44,840 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 508 flow [2022-12-13 00:41:44,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2022-12-13 00:41:44,841 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -8 predicate places. [2022-12-13 00:41:44,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:44,841 INFO L89 Accepts]: Start accepts. Operand has 76 places, 87 transitions, 508 flow [2022-12-13 00:41:44,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:44,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:44,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 87 transitions, 508 flow [2022-12-13 00:41:44,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 87 transitions, 508 flow [2022-12-13 00:41:45,549 INFO L130 PetriNetUnfolder]: 7568/14002 cut-off events. [2022-12-13 00:41:45,549 INFO L131 PetriNetUnfolder]: For 9574/11277 co-relation queries the response was YES. [2022-12-13 00:41:45,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44049 conditions, 14002 events. 7568/14002 cut-off events. For 9574/11277 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 132224 event pairs, 691 based on Foata normal form. 43/6720 useless extension candidates. Maximal degree in co-relation 44026. Up to 10693 conditions per place. [2022-12-13 00:41:45,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 87 transitions, 508 flow [2022-12-13 00:41:45,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 1742 [2022-12-13 00:41:45,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L833: Formula: (and (= v_P3Thread1of1ForFork3_~arg.base_7 |v_P3Thread1of1ForFork3_#in~arg.base_7|) (= v_P3Thread1of1ForFork3_~arg.offset_7 |v_P3Thread1of1ForFork3_#in~arg.offset_7|) (= v_~a~0_10 1) (= v_~z~0_13 1)) InVars {P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_7|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_7|} OutVars{~a~0=v_~a~0_10, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_7, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_7|, ~z~0=v_~z~0_13, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_7, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_7|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork3_~arg.offset, ~z~0, P3Thread1of1ForFork3_~arg.base] and [377] L810-->L813: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 00:41:45,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L833: Formula: (and (= v_P3Thread1of1ForFork3_~arg.base_7 |v_P3Thread1of1ForFork3_#in~arg.base_7|) (= v_P3Thread1of1ForFork3_~arg.offset_7 |v_P3Thread1of1ForFork3_#in~arg.offset_7|) (= v_~a~0_10 1) (= v_~z~0_13 1)) InVars {P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_7|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_7|} OutVars{~a~0=v_~a~0_10, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_7, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_7|, ~z~0=v_~z~0_13, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_7, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_7|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork3_~arg.offset, ~z~0, P3Thread1of1ForFork3_~arg.base] and [542] $Ultimate##0-->L760: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= v_~x~0_59 v_~__unbuffered_p0_EAX~0_94) (= v_~b~0_36 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, ~x~0=v_~x~0_59} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_94, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~b~0=v_~b~0_36, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, ~x~0=v_~x~0_59, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:41:45,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:41:45,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1143 [2022-12-13 00:41:45,984 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 86 transitions, 512 flow [2022-12-13 00:41:45,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 00:41:45,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:45,984 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] [2022-12-13 00:41:45,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:41:45,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 487994920, now seen corresponding path program 2 times [2022-12-13 00:41:45,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:45,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007275266] [2022-12-13 00:41:45,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:46,148 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 00:41:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:46,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007275266] [2022-12-13 00:41:46,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007275266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:46,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:46,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:41:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620370169] [2022-12-13 00:41:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:46,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:46,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:46,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2022-12-13 00:41:46,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 86 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 00:41:46,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:46,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2022-12-13 00:41:46,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:47,855 INFO L130 PetriNetUnfolder]: 15026/23211 cut-off events. [2022-12-13 00:41:47,856 INFO L131 PetriNetUnfolder]: For 21669/22635 co-relation queries the response was YES. [2022-12-13 00:41:47,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81063 conditions, 23211 events. 15026/23211 cut-off events. For 21669/22635 co-relation queries the response was YES. Maximal size of possible extension queue 1407. Compared 170469 event pairs, 287 based on Foata normal form. 2075/14284 useless extension candidates. Maximal degree in co-relation 81037. Up to 10072 conditions per place. [2022-12-13 00:41:47,975 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 30 selfloop transitions, 49 changer transitions 32/119 dead transitions. [2022-12-13 00:41:47,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 119 transitions, 848 flow [2022-12-13 00:41:47,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:41:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:41:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2022-12-13 00:41:47,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2022-12-13 00:41:47,976 INFO L175 Difference]: Start difference. First operand has 75 places, 86 transitions, 512 flow. Second operand 6 states and 166 transitions. [2022-12-13 00:41:47,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 119 transitions, 848 flow [2022-12-13 00:41:48,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 119 transitions, 797 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-13 00:41:48,902 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 510 flow [2022-12-13 00:41:48,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2022-12-13 00:41:48,904 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2022-12-13 00:41:48,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:48,904 INFO L89 Accepts]: Start accepts. Operand has 77 places, 73 transitions, 510 flow [2022-12-13 00:41:48,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:48,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:48,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 73 transitions, 510 flow [2022-12-13 00:41:48,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 73 transitions, 510 flow [2022-12-13 00:41:48,969 INFO L130 PetriNetUnfolder]: 759/1466 cut-off events. [2022-12-13 00:41:48,970 INFO L131 PetriNetUnfolder]: For 959/1140 co-relation queries the response was YES. [2022-12-13 00:41:48,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 1466 events. 759/1466 cut-off events. For 959/1140 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 9196 event pairs, 3 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 5718. Up to 973 conditions per place. [2022-12-13 00:41:48,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 73 transitions, 510 flow [2022-12-13 00:41:48,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 00:41:49,525 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:41:49,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 622 [2022-12-13 00:41:49,526 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 500 flow [2022-12-13 00:41:49,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 00:41:49,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:49,526 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] [2022-12-13 00:41:49,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:41:49,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash 754811708, now seen corresponding path program 1 times [2022-12-13 00:41:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:49,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798312995] [2022-12-13 00:41:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:49,897 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 00:41:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:49,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798312995] [2022-12-13 00:41:49,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798312995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:49,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:49,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:41:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863018541] [2022-12-13 00:41:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:49,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:49,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:49,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:41:49,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 00:41:49,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:49,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:41:49,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:50,275 INFO L130 PetriNetUnfolder]: 3266/5086 cut-off events. [2022-12-13 00:41:50,275 INFO L131 PetriNetUnfolder]: For 11255/11594 co-relation queries the response was YES. [2022-12-13 00:41:50,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22155 conditions, 5086 events. 3266/5086 cut-off events. For 11255/11594 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 30367 event pairs, 27 based on Foata normal form. 211/3837 useless extension candidates. Maximal degree in co-relation 22130. Up to 2604 conditions per place. [2022-12-13 00:41:50,301 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 82 selfloop transitions, 7 changer transitions 50/159 dead transitions. [2022-12-13 00:41:50,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 159 transitions, 1456 flow [2022-12-13 00:41:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:41:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:41:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-13 00:41:50,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 00:41:50,302 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 500 flow. Second operand 7 states and 126 transitions. [2022-12-13 00:41:50,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 159 transitions, 1456 flow [2022-12-13 00:41:50,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 159 transitions, 1127 flow, removed 63 selfloop flow, removed 9 redundant places. [2022-12-13 00:41:50,511 INFO L231 Difference]: Finished difference. Result has 66 places, 71 transitions, 383 flow [2022-12-13 00:41:50,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=66, PETRI_TRANSITIONS=71} [2022-12-13 00:41:50,512 INFO L295 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places. [2022-12-13 00:41:50,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:50,512 INFO L89 Accepts]: Start accepts. Operand has 66 places, 71 transitions, 383 flow [2022-12-13 00:41:50,513 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:50,513 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:50,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 71 transitions, 383 flow [2022-12-13 00:41:50,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 71 transitions, 383 flow [2022-12-13 00:41:50,610 INFO L130 PetriNetUnfolder]: 1682/2793 cut-off events. [2022-12-13 00:41:50,610 INFO L131 PetriNetUnfolder]: For 1563/1586 co-relation queries the response was YES. [2022-12-13 00:41:50,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7993 conditions, 2793 events. 1682/2793 cut-off events. For 1563/1586 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 18326 event pairs, 7 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 7973. Up to 1378 conditions per place. [2022-12-13 00:41:50,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 71 transitions, 383 flow [2022-12-13 00:41:50,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-13 00:41:50,627 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:50,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 00:41:50,628 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 383 flow [2022-12-13 00:41:50,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 00:41:50,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:50,628 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] [2022-12-13 00:41:50,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:41:50,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:41:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1029754340, now seen corresponding path program 2 times [2022-12-13 00:41:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948940596] [2022-12-13 00:41:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:41:50,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:41:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:41:50,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:41:50,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:41:50,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:41:50,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:41:50,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:41:50,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:41:50,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:41:50,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:41:50,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:41:50,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:41:50,703 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:41:50,706 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:41:50,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:41:50,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:41:50 BasicIcfg [2022-12-13 00:41:50,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:41:50,787 INFO L158 Benchmark]: Toolchain (without parser) took 36308.90ms. Allocated memory was 198.2MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 173.3MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-13 00:41:50,787 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:41:50,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.51ms. Allocated memory is still 198.2MB. Free memory was 173.3MB in the beginning and 145.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:41:50,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.08ms. Allocated memory is still 198.2MB. Free memory was 145.5MB in the beginning and 142.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:50,788 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory is still 198.2MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:50,788 INFO L158 Benchmark]: RCFGBuilder took 602.65ms. Allocated memory was 198.2MB in the beginning and 255.9MB in the end (delta: 57.7MB). Free memory was 140.8MB in the beginning and 222.7MB in the end (delta: -81.9MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. [2022-12-13 00:41:50,788 INFO L158 Benchmark]: TraceAbstraction took 35123.43ms. Allocated memory was 255.9MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 221.2MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-13 00:41:50,789 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.12ms. Allocated memory is still 198.2MB. Free memory is still 175.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 468.51ms. Allocated memory is still 198.2MB. Free memory was 173.3MB in the beginning and 145.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.08ms. Allocated memory is still 198.2MB. Free memory was 145.5MB in the beginning and 142.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.03ms. Allocated memory is still 198.2MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 602.65ms. Allocated memory was 198.2MB in the beginning and 255.9MB in the end (delta: 57.7MB). Free memory was 140.8MB in the beginning and 222.7MB in the end (delta: -81.9MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. * TraceAbstraction took 35123.43ms. Allocated memory was 255.9MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 221.2MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 139 PlacesBefore, 84 PlacesAfterwards, 128 TransitionsBefore, 73 TransitionsAfterwards, 2954 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5425, independent: 5239, independent conditional: 5239, independent unconditional: 0, dependent: 186, dependent conditional: 186, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5425, independent: 5239, independent conditional: 0, independent unconditional: 5239, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5425, independent: 5239, independent conditional: 0, independent unconditional: 5239, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5425, independent: 5239, independent conditional: 0, independent unconditional: 5239, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2520, independent: 2460, independent conditional: 0, independent unconditional: 2460, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2520, independent: 2427, independent conditional: 0, independent unconditional: 2427, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5425, independent: 2779, independent conditional: 0, independent unconditional: 2779, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 2520, unknown conditional: 0, unknown unconditional: 2520] , Statistics on independence cache: Total cache size (in pairs): 4369, Positive cache size: 4309, Positive conditional cache size: 0, Positive unconditional cache size: 4309, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, 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.2s, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 607, independent: 563, independent conditional: 563, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 607, independent: 563, independent conditional: 22, independent unconditional: 541, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 607, independent: 563, independent conditional: 22, independent unconditional: 541, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 607, independent: 563, independent conditional: 22, independent unconditional: 541, dependent: 44, dependent conditional: 5, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 464, independent: 434, independent conditional: 16, independent unconditional: 418, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 161, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 89, dependent conditional: 13, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 607, independent: 129, independent conditional: 6, independent unconditional: 123, dependent: 14, dependent conditional: 3, dependent unconditional: 11, unknown: 464, unknown conditional: 18, unknown unconditional: 446] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 434, Positive conditional cache size: 16, Positive unconditional cache size: 418, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, 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, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 1076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310, independent: 285, independent conditional: 285, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 310, independent: 285, independent conditional: 15, independent unconditional: 270, dependent: 25, dependent conditional: 8, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 310, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 310, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 310, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 450, Positive conditional cache size: 16, Positive unconditional cache size: 434, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 15, independent unconditional: 268, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 309, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 309, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 309, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 455, Positive conditional cache size: 16, Positive unconditional cache size: 439, 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: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, independent: 275, independent conditional: 275, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 299, independent: 275, independent conditional: 81, independent unconditional: 194, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 299, independent: 275, independent conditional: 69, independent unconditional: 206, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 299, independent: 275, independent conditional: 69, independent unconditional: 206, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 299, independent: 255, independent conditional: 63, independent unconditional: 192, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 22, unknown conditional: 6, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 475, Positive conditional cache size: 22, Positive unconditional cache size: 453, 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: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 343, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 343, independent: 313, independent conditional: 116, independent unconditional: 197, dependent: 30, dependent conditional: 6, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 343, independent: 313, independent conditional: 104, independent unconditional: 209, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 343, independent: 313, independent conditional: 104, independent unconditional: 209, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 343, independent: 309, independent conditional: 104, independent unconditional: 205, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 479, Positive conditional cache size: 22, Positive unconditional cache size: 457, 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: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 63 PlacesBefore, 62 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 611, independent: 547, independent conditional: 547, 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: 611, independent: 547, independent conditional: 244, independent unconditional: 303, dependent: 64, dependent conditional: 6, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 617, independent: 547, independent conditional: 168, independent unconditional: 379, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 617, independent: 547, independent conditional: 168, independent unconditional: 379, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 3, independent unconditional: 21, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 617, independent: 523, independent conditional: 165, independent unconditional: 358, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 26, unknown conditional: 3, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 581, Positive conditional cache size: 26, Positive unconditional cache size: 555, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 88, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 67 PlacesBefore, 67 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 597, independent: 558, independent conditional: 558, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 597, independent: 558, independent conditional: 334, independent unconditional: 224, dependent: 39, dependent conditional: 6, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 603, independent: 558, independent conditional: 302, independent unconditional: 256, 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: 603, independent: 558, independent conditional: 302, independent unconditional: 256, 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: 29, independent: 23, independent conditional: 12, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 603, independent: 535, independent conditional: 290, independent unconditional: 245, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 29, unknown conditional: 12, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 604, Positive conditional cache size: 38, Positive unconditional cache size: 566, Negative cache size: 43, Negative conditional cache size: 2, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 1730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 864, independent: 796, independent conditional: 796, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 864, independent: 796, independent conditional: 476, independent unconditional: 320, dependent: 68, dependent conditional: 12, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 864, independent: 796, independent conditional: 448, independent unconditional: 348, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 864, independent: 796, independent conditional: 448, independent unconditional: 348, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 864, independent: 794, independent conditional: 448, independent unconditional: 346, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 645, Positive conditional cache size: 40, Positive unconditional cache size: 605, Negative cache size: 43, Negative conditional cache size: 2, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 76 PlacesBefore, 75 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 1742 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 746, independent: 680, independent conditional: 680, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 746, independent: 680, independent conditional: 484, independent unconditional: 196, dependent: 66, dependent conditional: 10, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 756, independent: 680, independent conditional: 456, independent unconditional: 224, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 756, independent: 680, independent conditional: 456, independent unconditional: 224, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 3, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 756, independent: 678, independent conditional: 456, independent unconditional: 222, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 729, Positive cache size: 685, Positive conditional cache size: 40, Positive unconditional cache size: 645, Negative cache size: 44, Negative conditional cache size: 2, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 71 PlacesBefore, 66 PlacesAfterwards, 73 TransitionsBefore, 68 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 518, independent: 460, independent conditional: 460, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 518, independent: 460, independent conditional: 247, independent unconditional: 213, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 518, independent: 460, independent conditional: 246, independent unconditional: 214, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 518, independent: 460, independent conditional: 246, independent unconditional: 214, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 518, independent: 452, independent conditional: 246, independent unconditional: 206, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 761, Positive conditional cache size: 41, Positive unconditional cache size: 720, Negative cache size: 45, Negative conditional cache size: 2, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 761, Positive conditional cache size: 41, Positive unconditional cache size: 720, Negative cache size: 45, Negative conditional cache size: 2, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t941, ((void *)0), P0, ((void *)0))=-2, t941={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t942, ((void *)0), P1, ((void *)0))=-1, t941={5:0}, t942={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t943, ((void *)0), P2, ((void *)0))=0, t941={5:0}, t942={6:0}, t943={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t944, ((void *)0), P3, ((void *)0))=1, t941={5:0}, t942={6:0}, t943={7:0}, t944={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L803] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L803] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 [L812] 3 __unbuffered_p2_EAX = z 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}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 4 z = 1 [L832] 4 a = 1 [L835] 4 __unbuffered_p3_EAX = 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 4 __unbuffered_p3_EBX = b 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 b = 1 [L759] 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}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 x = 1 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] 2 __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 3 __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}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 1 __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 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}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 868]: 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: 864]: 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: 870]: 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: 866]: 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, 168 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: 35.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 27 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:41:50,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...