/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:19:45,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:19:45,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:19:45,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:19:45,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:19:45,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:19:45,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:19:45,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:19:45,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:19:45,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:19:45,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:19:45,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:19:45,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:19:45,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:19:45,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:19:45,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:19:45,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:19:45,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:19:45,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:19:45,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:19:45,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:19:45,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:19:45,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:19:45,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:19:45,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:19:45,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:19:45,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:19:45,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:19:45,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:19:45,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:19:45,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:19:45,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:19:45,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:19:45,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:19:45,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:19:45,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:19:45,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:19:45,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:19:45,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:19:45,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:19:45,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:19:45,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:19:45,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:19:45,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:19:45,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:19:45,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:19:45,911 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:19:45,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:19:45,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:19:45,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:19:45,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:19:45,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:19:45,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:19:45,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:19:45,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:19:45,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:19:45,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:19:45,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:19:45,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:19:45,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:19:45,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:19:45,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:19:45,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:19:45,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:45,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:19:45,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:19:45,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:19:45,915 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:19:45,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:19:45,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:19:45,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:19:45,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:19:46,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:19:46,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:19:46,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:19:46,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:19:46,224 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:19:46,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2022-12-13 09:19:47,264 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:19:47,541 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:19:47,541 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i [2022-12-13 09:19:47,568 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85bc9c67b/727a5e05290340b09318d3c2221a560c/FLAGdfdb09818 [2022-12-13 09:19:47,587 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85bc9c67b/727a5e05290340b09318d3c2221a560c [2022-12-13 09:19:47,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:19:47,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:19:47,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:47,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:19:47,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:19:47,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:47" (1/1) ... [2022-12-13 09:19:47,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a27e677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:47, skipping insertion in model container [2022-12-13 09:19:47,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:47" (1/1) ... [2022-12-13 09:19:47,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:19:47,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:19:47,776 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/mix015.oepc.i[945,958] [2022-12-13 09:19:47,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:47,960 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:19:47,967 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/mix015.oepc.i[945,958] [2022-12-13 09:19:47,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:47,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:47,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:48,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:48,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:48,058 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:19:48,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48 WrapperNode [2022-12-13 09:19:48,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:48,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:48,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:19:48,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:19:48,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,089 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-12-13 09:19:48,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:48,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:19:48,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:19:48,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:19:48,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,107 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:19:48,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:19:48,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:19:48,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:19:48,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (1/1) ... [2022-12-13 09:19:48,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:19:48,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:19:48,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:19:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:19:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:19:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:19:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:19:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:19:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:19:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:19:48,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:19:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:19:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:19:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:19:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:19:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:19:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:19:48,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:19:48,177 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:19:48,315 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:19:48,319 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:19:48,547 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:19:48,678 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:19:48,678 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:19:48,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:48 BoogieIcfgContainer [2022-12-13 09:19:48,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:19:48,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:19:48,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:19:48,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:19:48,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:19:47" (1/3) ... [2022-12-13 09:19:48,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f131699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:48, skipping insertion in model container [2022-12-13 09:19:48,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:48" (2/3) ... [2022-12-13 09:19:48,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f131699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:48, skipping insertion in model container [2022-12-13 09:19:48,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:48" (3/3) ... [2022-12-13 09:19:48,686 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2022-12-13 09:19:48,697 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:19:48,697 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:19:48,697 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:19:48,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:19:48,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 09:19:48,800 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 09:19:48,800 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:48,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 09:19:48,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 09:19:48,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-13 09:19:48,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:48,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 09:19:48,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-13 09:19:48,843 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 09:19:48,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:48,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 09:19:48,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 09:19:48,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 2240 [2022-12-13 09:19:53,463 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 09:19:53,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:19:53,479 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;@54c7b7f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:19:53,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:19:53,482 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-12-13 09:19:53,482 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:53,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:53,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:19:53,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 495171, now seen corresponding path program 1 times [2022-12-13 09:19:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:53,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979369283] [2022-12-13 09:19:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:53,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:53,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:53,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979369283] [2022-12-13 09:19:53,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979369283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:53,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:53,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301085705] [2022-12-13 09:19:53,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:53,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:53,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:53,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:53,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 68 [2022-12-13 09:19:53,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 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 09:19:53,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:53,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 68 [2022-12-13 09:19:53,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:55,368 INFO L130 PetriNetUnfolder]: 13250/20504 cut-off events. [2022-12-13 09:19:55,369 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 09:19:55,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39348 conditions, 20504 events. 13250/20504 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 1102. Compared 155246 event pairs, 1220 based on Foata normal form. 0/12333 useless extension candidates. Maximal degree in co-relation 39337. Up to 16747 conditions per place. [2022-12-13 09:19:55,437 INFO L137 encePairwiseOnDemand]: 63/68 looper letters, 37 selfloop transitions, 3 changer transitions 59/111 dead transitions. [2022-12-13 09:19:55,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 433 flow [2022-12-13 09:19:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-13 09:19:55,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2022-12-13 09:19:55,448 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 3 states and 140 transitions. [2022-12-13 09:19:55,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 433 flow [2022-12-13 09:19:55,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 428 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:19:55,453 INFO L231 Difference]: Finished difference. Result has 75 places, 36 transitions, 84 flow [2022-12-13 09:19:55,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=75, PETRI_TRANSITIONS=36} [2022-12-13 09:19:55,457 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2022-12-13 09:19:55,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:55,458 INFO L89 Accepts]: Start accepts. Operand has 75 places, 36 transitions, 84 flow [2022-12-13 09:19:55,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:55,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:55,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 36 transitions, 84 flow [2022-12-13 09:19:55,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 84 flow [2022-12-13 09:19:55,467 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 09:19:55,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:55,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 96 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:19:55,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 84 flow [2022-12-13 09:19:55,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 09:19:55,630 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:55,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 09:19:55,632 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 84 flow [2022-12-13 09:19:55,632 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 09:19:55,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:55,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:19:55,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -483356681, now seen corresponding path program 1 times [2022-12-13 09:19:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:55,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801715747] [2022-12-13 09:19:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:55,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:55,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801715747] [2022-12-13 09:19:55,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801715747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:55,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:55,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870183963] [2022-12-13 09:19:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:55,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:55,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2022-12-13 09:19:55,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:55,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:55,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2022-12-13 09:19:55,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:56,220 INFO L130 PetriNetUnfolder]: 4117/6211 cut-off events. [2022-12-13 09:19:56,220 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2022-12-13 09:19:56,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12667 conditions, 6211 events. 4117/6211 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 32977 event pairs, 1912 based on Foata normal form. 0/4907 useless extension candidates. Maximal degree in co-relation 12657. Up to 5745 conditions per place. [2022-12-13 09:19:56,248 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 36 selfloop transitions, 4 changer transitions 2/50 dead transitions. [2022-12-13 09:19:56,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 204 flow [2022-12-13 09:19:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 09:19:56,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2022-12-13 09:19:56,250 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 84 flow. Second operand 3 states and 67 transitions. [2022-12-13 09:19:56,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 204 flow [2022-12-13 09:19:56,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:56,251 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 102 flow [2022-12-13 09:19:56,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 09:19:56,252 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 09:19:56,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:56,252 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 102 flow [2022-12-13 09:19:56,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:56,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:56,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 102 flow [2022-12-13 09:19:56,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 102 flow [2022-12-13 09:19:56,272 INFO L130 PetriNetUnfolder]: 14/96 cut-off events. [2022-12-13 09:19:56,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 96 events. 14/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 397 event pairs, 6 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 129. Up to 29 conditions per place. [2022-12-13 09:19:56,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 102 flow [2022-12-13 09:19:56,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-13 09:19:56,341 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:56,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-13 09:19:56,343 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 102 flow [2022-12-13 09:19:56,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:56,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:56,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:56,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:19:56,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1424549762, now seen corresponding path program 1 times [2022-12-13 09:19:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:56,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280677028] [2022-12-13 09:19:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:56,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280677028] [2022-12-13 09:19:56,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280677028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:56,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:56,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684854485] [2022-12-13 09:19:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:56,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:56,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 09:19:56,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:56,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:56,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 09:19:56,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:56,895 INFO L130 PetriNetUnfolder]: 3031/4616 cut-off events. [2022-12-13 09:19:56,895 INFO L131 PetriNetUnfolder]: For 592/592 co-relation queries the response was YES. [2022-12-13 09:19:56,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9965 conditions, 4616 events. 3031/4616 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23152 event pairs, 879 based on Foata normal form. 84/3944 useless extension candidates. Maximal degree in co-relation 9954. Up to 3273 conditions per place. [2022-12-13 09:19:56,919 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 41 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2022-12-13 09:19:56,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 222 flow [2022-12-13 09:19:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 09:19:56,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-13 09:19:56,922 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 102 flow. Second operand 3 states and 66 transitions. [2022-12-13 09:19:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 222 flow [2022-12-13 09:19:56,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:56,924 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:56,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 09:19:56,925 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -31 predicate places. [2022-12-13 09:19:56,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:56,925 INFO L89 Accepts]: Start accepts. Operand has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:56,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:56,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:56,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:56,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:56,931 INFO L130 PetriNetUnfolder]: 9/69 cut-off events. [2022-12-13 09:19:56,931 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 09:19:56,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 69 events. 9/69 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 266 event pairs, 2 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 103. Up to 21 conditions per place. [2022-12-13 09:19:56,933 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:56,933 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 09:19:56,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:56,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 09:19:56,979 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 109 flow [2022-12-13 09:19:56,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:56,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:56,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:56,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:19:56,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -649364946, now seen corresponding path program 1 times [2022-12-13 09:19:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903146415] [2022-12-13 09:19:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:57,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903146415] [2022-12-13 09:19:57,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903146415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:57,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:57,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568788196] [2022-12-13 09:19:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:57,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:57,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:57,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 09:19:57,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:57,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:57,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 09:19:57,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:57,379 INFO L130 PetriNetUnfolder]: 2794/4301 cut-off events. [2022-12-13 09:19:57,379 INFO L131 PetriNetUnfolder]: For 1195/1195 co-relation queries the response was YES. [2022-12-13 09:19:57,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9568 conditions, 4301 events. 2794/4301 cut-off events. For 1195/1195 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 21728 event pairs, 1907 based on Foata normal form. 90/3698 useless extension candidates. Maximal degree in co-relation 9555. Up to 2821 conditions per place. [2022-12-13 09:19:57,406 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 43 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2022-12-13 09:19:57,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 248 flow [2022-12-13 09:19:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:57,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 09:19:57,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-13 09:19:57,407 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 109 flow. Second operand 3 states and 69 transitions. [2022-12-13 09:19:57,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 248 flow [2022-12-13 09:19:57,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:57,411 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 112 flow [2022-12-13 09:19:57,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-13 09:19:57,413 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -30 predicate places. [2022-12-13 09:19:57,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:57,413 INFO L89 Accepts]: Start accepts. Operand has 48 places, 37 transitions, 112 flow [2022-12-13 09:19:57,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:57,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:57,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 112 flow [2022-12-13 09:19:57,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 112 flow [2022-12-13 09:19:57,421 INFO L130 PetriNetUnfolder]: 6/63 cut-off events. [2022-12-13 09:19:57,421 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 09:19:57,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 63 events. 6/63 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 2 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 96. Up to 16 conditions per place. [2022-12-13 09:19:57,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 112 flow [2022-12-13 09:19:57,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 09:19:57,439 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:57,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 09:19:57,440 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 112 flow [2022-12-13 09:19:57,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:57,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:57,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:57,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:19:57,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1103163889, now seen corresponding path program 1 times [2022-12-13 09:19:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:57,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145553248] [2022-12-13 09:19:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145553248] [2022-12-13 09:19:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145553248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:57,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:57,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:19:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086603435] [2022-12-13 09:19:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:57,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:57,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:19:57,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:57,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:57,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:19:57,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:57,782 INFO L130 PetriNetUnfolder]: 2333/3630 cut-off events. [2022-12-13 09:19:57,782 INFO L131 PetriNetUnfolder]: For 1409/1418 co-relation queries the response was YES. [2022-12-13 09:19:57,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8412 conditions, 3630 events. 2333/3630 cut-off events. For 1409/1418 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19515 event pairs, 610 based on Foata normal form. 62/2693 useless extension candidates. Maximal degree in co-relation 8398. Up to 3337 conditions per place. [2022-12-13 09:19:57,795 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 38 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2022-12-13 09:19:57,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 259 flow [2022-12-13 09:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:19:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:19:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 09:19:57,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2022-12-13 09:19:57,796 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 112 flow. Second operand 3 states and 72 transitions. [2022-12-13 09:19:57,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 259 flow [2022-12-13 09:19:57,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:57,798 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:57,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 09:19:57,799 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -30 predicate places. [2022-12-13 09:19:57,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:57,799 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:57,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:57,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:57,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:57,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:57,825 INFO L130 PetriNetUnfolder]: 326/694 cut-off events. [2022-12-13 09:19:57,825 INFO L131 PetriNetUnfolder]: For 132/138 co-relation queries the response was YES. [2022-12-13 09:19:57,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 694 events. 326/694 cut-off events. For 132/138 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4622 event pairs, 151 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 1406. Up to 529 conditions per place. [2022-12-13 09:19:57,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:57,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-13 09:19:57,836 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:57,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 09:19:57,837 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 174 flow [2022-12-13 09:19:57,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:57,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:57,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:19:57,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:19:57,838 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:57,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:57,838 INFO L85 PathProgramCache]: Analyzing trace with hash -106966426, now seen corresponding path program 1 times [2022-12-13 09:19:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:57,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952135614] [2022-12-13 09:19:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952135614] [2022-12-13 09:19:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952135614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:57,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:57,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:19:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168495958] [2022-12-13 09:19:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:57,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:19:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:19:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:19:57,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 09:19:57,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:57,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:57,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 09:19:57,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:58,111 INFO L130 PetriNetUnfolder]: 1184/2097 cut-off events. [2022-12-13 09:19:58,111 INFO L131 PetriNetUnfolder]: For 613/613 co-relation queries the response was YES. [2022-12-13 09:19:58,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 2097 events. 1184/2097 cut-off events. For 613/613 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11895 event pairs, 190 based on Foata normal form. 153/1686 useless extension candidates. Maximal degree in co-relation 5956. Up to 1306 conditions per place. [2022-12-13 09:19:58,121 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 48 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2022-12-13 09:19:58,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 400 flow [2022-12-13 09:19:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:19:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:19:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-13 09:19:58,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7279411764705882 [2022-12-13 09:19:58,122 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 174 flow. Second operand 4 states and 99 transitions. [2022-12-13 09:19:58,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 400 flow [2022-12-13 09:19:58,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:19:58,125 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:58,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2022-12-13 09:19:58,125 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -27 predicate places. [2022-12-13 09:19:58,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:58,126 INFO L89 Accepts]: Start accepts. Operand has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:58,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:58,126 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:58,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:58,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:58,152 INFO L130 PetriNetUnfolder]: 221/562 cut-off events. [2022-12-13 09:19:58,152 INFO L131 PetriNetUnfolder]: For 231/267 co-relation queries the response was YES. [2022-12-13 09:19:58,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 562 events. 221/562 cut-off events. For 231/267 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3741 event pairs, 37 based on Foata normal form. 4/344 useless extension candidates. Maximal degree in co-relation 1616. Up to 373 conditions per place. [2022-12-13 09:19:58,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:58,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 848 [2022-12-13 09:19:58,159 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:19:58,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 09:19:58,159 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 276 flow [2022-12-13 09:19:58,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:58,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:58,160 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 09:19:58,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:19:58,160 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1847045578, now seen corresponding path program 1 times [2022-12-13 09:19:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:58,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088268855] [2022-12-13 09:19:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:58,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088268855] [2022-12-13 09:19:58,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088268855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:58,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:58,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84224844] [2022-12-13 09:19:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:58,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:19:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:19:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:19:58,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2022-12-13 09:19:58,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:58,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:58,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2022-12-13 09:19:58,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:59,053 INFO L130 PetriNetUnfolder]: 1882/3602 cut-off events. [2022-12-13 09:19:59,054 INFO L131 PetriNetUnfolder]: For 2846/3201 co-relation queries the response was YES. [2022-12-13 09:19:59,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12180 conditions, 3602 events. 1882/3602 cut-off events. For 2846/3201 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 25630 event pairs, 277 based on Foata normal form. 252/3223 useless extension candidates. Maximal degree in co-relation 12163. Up to 1961 conditions per place. [2022-12-13 09:19:59,073 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 114 selfloop transitions, 6 changer transitions 6/145 dead transitions. [2022-12-13 09:19:59,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 145 transitions, 997 flow [2022-12-13 09:19:59,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:19:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:19:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-12-13 09:19:59,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2022-12-13 09:19:59,075 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 276 flow. Second operand 6 states and 148 transitions. [2022-12-13 09:19:59,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 145 transitions, 997 flow [2022-12-13 09:19:59,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 145 transitions, 879 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-13 09:19:59,085 INFO L231 Difference]: Finished difference. Result has 57 places, 59 transitions, 275 flow [2022-12-13 09:19:59,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2022-12-13 09:19:59,086 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2022-12-13 09:19:59,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:59,086 INFO L89 Accepts]: Start accepts. Operand has 57 places, 59 transitions, 275 flow [2022-12-13 09:19:59,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:59,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:59,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 59 transitions, 275 flow [2022-12-13 09:19:59,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 275 flow [2022-12-13 09:19:59,155 INFO L130 PetriNetUnfolder]: 602/1525 cut-off events. [2022-12-13 09:19:59,155 INFO L131 PetriNetUnfolder]: For 761/794 co-relation queries the response was YES. [2022-12-13 09:19:59,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1525 events. 602/1525 cut-off events. For 761/794 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 13192 event pairs, 119 based on Foata normal form. 8/850 useless extension candidates. Maximal degree in co-relation 4197. Up to 1081 conditions per place. [2022-12-13 09:19:59,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 59 transitions, 275 flow [2022-12-13 09:19:59,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-13 09:19:59,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:19:59,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 09:19:59,342 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 279 flow [2022-12-13 09:19:59,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:59,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:59,343 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 09:19:59,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:19:59,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:19:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash 545845340, now seen corresponding path program 2 times [2022-12-13 09:19:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:59,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738250006] [2022-12-13 09:19:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:59,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738250006] [2022-12-13 09:19:59,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738250006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:59,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:59,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:19:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282434045] [2022-12-13 09:19:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:59,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:19:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:19:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:19:59,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 09:19:59,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:59,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:59,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 09:19:59,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:19:59,771 INFO L130 PetriNetUnfolder]: 1215/2314 cut-off events. [2022-12-13 09:19:59,771 INFO L131 PetriNetUnfolder]: For 1710/1710 co-relation queries the response was YES. [2022-12-13 09:19:59,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7652 conditions, 2314 events. 1215/2314 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14520 event pairs, 104 based on Foata normal form. 270/1793 useless extension candidates. Maximal degree in co-relation 7632. Up to 901 conditions per place. [2022-12-13 09:19:59,782 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 42 selfloop transitions, 28 changer transitions 5/85 dead transitions. [2022-12-13 09:19:59,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 523 flow [2022-12-13 09:19:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:19:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:19:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 09:19:59,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2022-12-13 09:19:59,783 INFO L175 Difference]: Start difference. First operand has 57 places, 59 transitions, 279 flow. Second operand 5 states and 108 transitions. [2022-12-13 09:19:59,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 523 flow [2022-12-13 09:19:59,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 85 transitions, 500 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 09:19:59,788 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 322 flow [2022-12-13 09:19:59,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-12-13 09:19:59,789 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-13 09:19:59,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:19:59,789 INFO L89 Accepts]: Start accepts. Operand has 58 places, 57 transitions, 322 flow [2022-12-13 09:19:59,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:19:59,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:59,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 57 transitions, 322 flow [2022-12-13 09:19:59,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 57 transitions, 322 flow [2022-12-13 09:19:59,817 INFO L130 PetriNetUnfolder]: 224/638 cut-off events. [2022-12-13 09:19:59,817 INFO L131 PetriNetUnfolder]: For 235/349 co-relation queries the response was YES. [2022-12-13 09:19:59,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 638 events. 224/638 cut-off events. For 235/349 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4532 event pairs, 2 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 2109. Up to 433 conditions per place. [2022-12-13 09:19:59,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 57 transitions, 322 flow [2022-12-13 09:19:59,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 802 [2022-12-13 09:20:00,232 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:20:00,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 444 [2022-12-13 09:20:00,233 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 318 flow [2022-12-13 09:20:00,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:00,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:00,233 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 09:20:00,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:20:00,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:20:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash -14509734, now seen corresponding path program 1 times [2022-12-13 09:20:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:00,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047660423] [2022-12-13 09:20:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047660423] [2022-12-13 09:20:00,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047660423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:00,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673463992] [2022-12-13 09:20:00,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:00,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:00,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:20:00,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:00,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:00,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:20:00,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:00,684 INFO L130 PetriNetUnfolder]: 1682/2979 cut-off events. [2022-12-13 09:20:00,684 INFO L131 PetriNetUnfolder]: For 3933/4136 co-relation queries the response was YES. [2022-12-13 09:20:00,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11177 conditions, 2979 events. 1682/2979 cut-off events. For 3933/4136 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18540 event pairs, 166 based on Foata normal form. 198/2569 useless extension candidates. Maximal degree in co-relation 11158. Up to 1498 conditions per place. [2022-12-13 09:20:00,696 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 79 selfloop transitions, 12 changer transitions 7/112 dead transitions. [2022-12-13 09:20:00,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 112 transitions, 824 flow [2022-12-13 09:20:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 09:20:00,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 09:20:00,697 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 318 flow. Second operand 5 states and 105 transitions. [2022-12-13 09:20:00,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 112 transitions, 824 flow [2022-12-13 09:20:00,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 688 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:00,731 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 316 flow [2022-12-13 09:20:00,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2022-12-13 09:20:00,732 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2022-12-13 09:20:00,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:00,732 INFO L89 Accepts]: Start accepts. Operand has 57 places, 62 transitions, 316 flow [2022-12-13 09:20:00,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:00,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:00,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 62 transitions, 316 flow [2022-12-13 09:20:00,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 62 transitions, 316 flow [2022-12-13 09:20:00,777 INFO L130 PetriNetUnfolder]: 479/1070 cut-off events. [2022-12-13 09:20:00,777 INFO L131 PetriNetUnfolder]: For 603/642 co-relation queries the response was YES. [2022-12-13 09:20:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 1070 events. 479/1070 cut-off events. For 603/642 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 7641 event pairs, 5 based on Foata normal form. 9/428 useless extension candidates. Maximal degree in co-relation 2936. Up to 523 conditions per place. [2022-12-13 09:20:00,785 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 62 transitions, 316 flow [2022-12-13 09:20:00,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 950 [2022-12-13 09:20:00,809 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:00,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 09:20:00,810 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 316 flow [2022-12-13 09:20:00,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:00,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:00,810 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 09:20:00,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:20:00,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:20:00,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash 810201116, now seen corresponding path program 2 times [2022-12-13 09:20:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:00,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246116630] [2022-12-13 09:20:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:00,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246116630] [2022-12-13 09:20:00,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246116630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:00,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:00,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278997088] [2022-12-13 09:20:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:00,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 09:20:00,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:00,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:00,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 09:20:00,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:01,239 INFO L130 PetriNetUnfolder]: 2155/3832 cut-off events. [2022-12-13 09:20:01,239 INFO L131 PetriNetUnfolder]: For 4717/4972 co-relation queries the response was YES. [2022-12-13 09:20:01,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13198 conditions, 3832 events. 2155/3832 cut-off events. For 4717/4972 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 25267 event pairs, 248 based on Foata normal form. 234/3240 useless extension candidates. Maximal degree in co-relation 13178. Up to 1876 conditions per place. [2022-12-13 09:20:01,256 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 76 selfloop transitions, 16 changer transitions 13/119 dead transitions. [2022-12-13 09:20:01,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 119 transitions, 816 flow [2022-12-13 09:20:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 09:20:01,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2022-12-13 09:20:01,257 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 316 flow. Second operand 5 states and 103 transitions. [2022-12-13 09:20:01,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 119 transitions, 816 flow [2022-12-13 09:20:01,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 812 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 09:20:01,330 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 447 flow [2022-12-13 09:20:01,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2022-12-13 09:20:01,331 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -14 predicate places. [2022-12-13 09:20:01,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:01,331 INFO L89 Accepts]: Start accepts. Operand has 64 places, 72 transitions, 447 flow [2022-12-13 09:20:01,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:01,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:01,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 72 transitions, 447 flow [2022-12-13 09:20:01,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 72 transitions, 447 flow [2022-12-13 09:20:01,394 INFO L130 PetriNetUnfolder]: 713/1559 cut-off events. [2022-12-13 09:20:01,395 INFO L131 PetriNetUnfolder]: For 1079/1123 co-relation queries the response was YES. [2022-12-13 09:20:01,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4402 conditions, 1559 events. 713/1559 cut-off events. For 1079/1123 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 12198 event pairs, 3 based on Foata normal form. 11/609 useless extension candidates. Maximal degree in co-relation 4380. Up to 739 conditions per place. [2022-12-13 09:20:01,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 72 transitions, 447 flow [2022-12-13 09:20:01,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 1112 [2022-12-13 09:20:01,417 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:01,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 09:20:01,418 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 447 flow [2022-12-13 09:20:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:01,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:01,418 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 09:20:01,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:20:01,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:20:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash 403195251, now seen corresponding path program 1 times [2022-12-13 09:20:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:01,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694913969] [2022-12-13 09:20:01,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:01,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694913969] [2022-12-13 09:20:01,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694913969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:01,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:01,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930587510] [2022-12-13 09:20:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:01,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:01,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:01,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 09:20:01,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 09:20:01,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:01,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 09:20:01,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:01,870 INFO L130 PetriNetUnfolder]: 2686/4950 cut-off events. [2022-12-13 09:20:01,870 INFO L131 PetriNetUnfolder]: For 7545/7881 co-relation queries the response was YES. [2022-12-13 09:20:01,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17369 conditions, 4950 events. 2686/4950 cut-off events. For 7545/7881 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 36385 event pairs, 515 based on Foata normal form. 227/4017 useless extension candidates. Maximal degree in co-relation 17344. Up to 2011 conditions per place. [2022-12-13 09:20:01,891 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 42 selfloop transitions, 1 changer transitions 56/117 dead transitions. [2022-12-13 09:20:01,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 117 transitions, 867 flow [2022-12-13 09:20:01,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:20:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:20:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 09:20:01,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-12-13 09:20:01,892 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 447 flow. Second operand 4 states and 90 transitions. [2022-12-13 09:20:01,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 117 transitions, 867 flow [2022-12-13 09:20:02,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 867 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:20:02,024 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 328 flow [2022-12-13 09:20:02,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2022-12-13 09:20:02,024 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -10 predicate places. [2022-12-13 09:20:02,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:02,024 INFO L89 Accepts]: Start accepts. Operand has 68 places, 58 transitions, 328 flow [2022-12-13 09:20:02,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:02,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:02,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 58 transitions, 328 flow [2022-12-13 09:20:02,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 328 flow [2022-12-13 09:20:02,064 INFO L130 PetriNetUnfolder]: 431/958 cut-off events. [2022-12-13 09:20:02,065 INFO L131 PetriNetUnfolder]: For 1186/1240 co-relation queries the response was YES. [2022-12-13 09:20:02,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 958 events. 431/958 cut-off events. For 1186/1240 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 6926 event pairs, 0 based on Foata normal form. 7/355 useless extension candidates. Maximal degree in co-relation 2751. Up to 469 conditions per place. [2022-12-13 09:20:02,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 328 flow [2022-12-13 09:20:02,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 09:20:02,142 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:20:02,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 09:20:02,143 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 335 flow [2022-12-13 09:20:02,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 09:20:02,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:02,143 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 09:20:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:20:02,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:20:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1518615343, now seen corresponding path program 1 times [2022-12-13 09:20:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:02,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027201557] [2022-12-13 09:20:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:02,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:20:02,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:20:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:20:02,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:20:02,236 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:20:02,237 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:20:02,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:20:02,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:20:02,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:20:02,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:20:02,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:20:02,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:20:02,239 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:02,243 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:20:02,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:20:02,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:20:02 BasicIcfg [2022-12-13 09:20:02,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:20:02,291 INFO L158 Benchmark]: Toolchain (without parser) took 14701.45ms. Allocated memory was 189.8MB in the beginning and 863.0MB in the end (delta: 673.2MB). Free memory was 165.2MB in the beginning and 289.7MB in the end (delta: -124.5MB). Peak memory consumption was 549.2MB. Max. memory is 8.0GB. [2022-12-13 09:20:02,292 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:20:02,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.05ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 138.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 09:20:02,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.93ms. Allocated memory is still 189.8MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:02,292 INFO L158 Benchmark]: Boogie Preprocessor took 20.25ms. Allocated memory is still 189.8MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:20:02,292 INFO L158 Benchmark]: RCFGBuilder took 568.78ms. Allocated memory is still 189.8MB. Free memory was 133.8MB in the beginning and 156.8MB in the end (delta: -23.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 09:20:02,292 INFO L158 Benchmark]: TraceAbstraction took 13610.01ms. Allocated memory was 189.8MB in the beginning and 863.0MB in the end (delta: 673.2MB). Free memory was 155.2MB in the beginning and 289.7MB in the end (delta: -134.5MB). Peak memory consumption was 538.7MB. Max. memory is 8.0GB. [2022-12-13 09:20:02,293 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.13ms. Allocated memory is still 189.8MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 467.05ms. Allocated memory is still 189.8MB. Free memory was 165.2MB in the beginning and 138.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.93ms. Allocated memory is still 189.8MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.25ms. Allocated memory is still 189.8MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 568.78ms. Allocated memory is still 189.8MB. Free memory was 133.8MB in the beginning and 156.8MB in the end (delta: -23.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 13610.01ms. Allocated memory was 189.8MB in the beginning and 863.0MB in the end (delta: 673.2MB). Free memory was 155.2MB in the beginning and 289.7MB in the end (delta: -134.5MB). Peak memory consumption was 538.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 120 PlacesBefore, 78 PlacesAfterwards, 112 TransitionsBefore, 68 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4542, independent: 4293, independent conditional: 4293, independent unconditional: 0, dependent: 249, dependent conditional: 249, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2441, independent: 2383, independent conditional: 0, independent unconditional: 2383, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2441, independent: 2383, independent conditional: 0, independent unconditional: 2383, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2441, independent: 2348, independent conditional: 0, independent unconditional: 2348, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 249, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4542, independent: 1910, independent conditional: 1910, independent unconditional: 0, dependent: 191, dependent conditional: 191, dependent unconditional: 0, unknown: 2441, unknown conditional: 2441, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2441, Positive cache size: 2383, Positive conditional cache size: 2383, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 317, independent: 277, independent conditional: 277, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 222, independent conditional: 27, independent unconditional: 195, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 250, independent: 222, independent conditional: 27, independent unconditional: 195, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 250, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 152, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 144, dependent conditional: 67, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 317, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 250, unknown conditional: 250, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 222, Positive conditional cache size: 222, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 248, independent: 215, independent conditional: 215, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 91, independent conditional: 5, independent unconditional: 86, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 103, independent: 91, independent conditional: 5, independent unconditional: 86, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 103, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 59, dependent conditional: 1, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 103, unknown conditional: 103, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 313, Positive conditional cache size: 313, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 22, independent conditional: 11, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 234, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 335, Positive conditional cache size: 335, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 214, independent: 165, independent conditional: 165, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 350, Positive conditional cache size: 350, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 352, Positive conditional cache size: 352, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 181, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, independent: 139, independent conditional: 139, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 353, Positive conditional cache size: 353, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 57 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 23, independent unconditional: 13, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 23, independent unconditional: 13, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 389, Positive conditional cache size: 389, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 57 PlacesBefore, 55 PlacesAfterwards, 57 TransitionsBefore, 55 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 103, independent conditional: 103, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 408, Positive conditional cache size: 408, Positive unconditional cache size: 0, Negative cache size: 57, Negative conditional cache size: 57, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 950 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 190, independent: 160, independent conditional: 160, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 34, independent conditional: 30, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 34, independent conditional: 30, independent unconditional: 4, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 34, independent conditional: 0, independent unconditional: 34, 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: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 190, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 501, Positive cache size: 442, Positive conditional cache size: 442, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 1112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 449, Positive conditional cache size: 449, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 65 PlacesBefore, 64 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 139, independent conditional: 139, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 40, independent conditional: 17, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 40, independent conditional: 17, independent unconditional: 23, 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: 41, independent: 40, independent conditional: 0, independent unconditional: 40, 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: 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] ], Cache Queries: [ total: 161, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 489, Positive conditional cache size: 489, Positive unconditional cache size: 0, Negative cache size: 61, Negative conditional cache size: 61, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=7, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=8, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=9, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 18 mSDtfsCounter, 1000 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=10, InterpolantAutomatonStates: 44, 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.7s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 897 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 09:20:02,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...