/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:38:22,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:38:22,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:38:22,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:38:22,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:38:22,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:38:22,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:38:22,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:38:22,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:38:22,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:38:22,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:38:22,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:38:22,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:38:22,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:38:22,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:38:22,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:38:22,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:38:22,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:38:22,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:38:22,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:38:22,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:38:22,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:38:22,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:38:22,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:38:22,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:38:22,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:38:22,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:38:22,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:38:22,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:38:22,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:38:22,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:38:22,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:38:22,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:38:22,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:38:22,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:38:22,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:38:22,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:38:22,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:38:22,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:38:22,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:38:22,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:38:22,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:38:22,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:38:22,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:38:22,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:38:22,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:38:22,932 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:38:22,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:38:22,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:38:22,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:38:22,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:38:22,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:38:22,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:38:22,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:38:22,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:38:22,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:38:22,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:38:22,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:38:22,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:38:22,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:38:22,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:38:22,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:38:22,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:38:22,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:38:22,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:38:22,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:38:22,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:38:22,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:38:22,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:38:22,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:38:22,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:38:23,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:38:23,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:38:23,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:38:23,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:38:23,278 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:38:23,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:38:24,365 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:38:24,623 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:38:24,624 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:38:24,639 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c192ca5d6/1119d2ac24b64728ac98d858de5c00ad/FLAG373aa68f3 [2022-12-13 00:38:24,653 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c192ca5d6/1119d2ac24b64728ac98d858de5c00ad [2022-12-13 00:38:24,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:38:24,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:38:24,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:38:24,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:38:24,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:38:24,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:38:24" (1/1) ... [2022-12-13 00:38:24,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54386498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:24, skipping insertion in model container [2022-12-13 00:38:24,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:38:24" (1/1) ... [2022-12-13 00:38:24,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:38:24,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:38:24,825 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/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-12-13 00:38:24,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:24,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:24,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:24,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:24,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:24,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:24,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:38:25,062 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:38:25,073 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/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-12-13 00:38:25,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:38:25,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:38:25,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:38:25,187 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:38:25,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25 WrapperNode [2022-12-13 00:38:25,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:38:25,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:38:25,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:38:25,191 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:38:25,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,263 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-13 00:38:25,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:38:25,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:38:25,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:38:25,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:38:25,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:38:25,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:38:25,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:38:25,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:38:25,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (1/1) ... [2022-12-13 00:38:25,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:38:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:38:25,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:38:25,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:38:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:38:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:38:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:38:25,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:38:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:38:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:38:25,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:38:25,386 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:38:25,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:38:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:38:25,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:38:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:38:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:38:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:38:25,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:38:25,389 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:38:25,547 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:38:25,548 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:38:25,893 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:38:26,013 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:38:26,013 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:38:26,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:38:26 BoogieIcfgContainer [2022-12-13 00:38:26,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:38:26,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:38:26,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:38:26,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:38:26,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:38:24" (1/3) ... [2022-12-13 00:38:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3bb791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:38:26, skipping insertion in model container [2022-12-13 00:38:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:38:25" (2/3) ... [2022-12-13 00:38:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3bb791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:38:26, skipping insertion in model container [2022-12-13 00:38:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:38:26" (3/3) ... [2022-12-13 00:38:26,023 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2022-12-13 00:38:26,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:38:26,037 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:38:26,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:38:26,089 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:38:26,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 00:38:26,200 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 00:38:26,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:38:26,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 00:38:26,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 00:38:26,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-13 00:38:26,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:26,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 00:38:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-13 00:38:26,319 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 00:38:26,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:38:26,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-13 00:38:26,324 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 00:38:26,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 2112 [2022-12-13 00:38:31,504 INFO L241 LiptonReduction]: Total number of compositions: 88 [2022-12-13 00:38:31,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:38:31,527 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;@54fabde5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:38:31,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:38:31,530 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 00:38:31,531 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:38:31,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:31,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:38:31,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:31,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash 467190774, now seen corresponding path program 1 times [2022-12-13 00:38:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:31,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037516185] [2022-12-13 00:38:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:31,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:31,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037516185] [2022-12-13 00:38:31,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037516185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:31,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:31,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:38:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600355319] [2022-12-13 00:38:31,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:31,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:38:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:31,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:38:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:38:31,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 62 [2022-12-13 00:38:31,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:31,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:31,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 62 [2022-12-13 00:38:31,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:33,617 INFO L130 PetriNetUnfolder]: 9280/14698 cut-off events. [2022-12-13 00:38:33,618 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 00:38:33,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28000 conditions, 14698 events. 9280/14698 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 106206 event pairs, 2586 based on Foata normal form. 0/8475 useless extension candidates. Maximal degree in co-relation 27989. Up to 11189 conditions per place. [2022-12-13 00:38:33,669 INFO L137 encePairwiseOnDemand]: 58/62 looper letters, 34 selfloop transitions, 2 changer transitions 50/99 dead transitions. [2022-12-13 00:38:33,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 382 flow [2022-12-13 00:38:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:38:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:38:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-12-13 00:38:33,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2022-12-13 00:38:33,683 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 133 flow. Second operand 3 states and 128 transitions. [2022-12-13 00:38:33,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 382 flow [2022-12-13 00:38:33,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 99 transitions, 378 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:38:33,689 INFO L231 Difference]: Finished difference. Result has 69 places, 35 transitions, 80 flow [2022-12-13 00:38:33,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=69, PETRI_TRANSITIONS=35} [2022-12-13 00:38:33,696 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2022-12-13 00:38:33,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:33,697 INFO L89 Accepts]: Start accepts. Operand has 69 places, 35 transitions, 80 flow [2022-12-13 00:38:33,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:33,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:33,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 35 transitions, 80 flow [2022-12-13 00:38:33,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2022-12-13 00:38:33,718 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 00:38:33,718 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:38:33,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:38:33,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2022-12-13 00:38:33,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 704 [2022-12-13 00:38:33,865 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:33,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 00:38:33,867 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 80 flow [2022-12-13 00:38:33,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:33,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:33,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:33,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:38:33,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1005304745, now seen corresponding path program 1 times [2022-12-13 00:38:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564589370] [2022-12-13 00:38:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:34,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564589370] [2022-12-13 00:38:34,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564589370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:34,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:34,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:38:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454109895] [2022-12-13 00:38:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:34,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:38:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:38:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:38:34,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:38:34,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 80 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 00:38:34,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:34,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:38:34,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:34,883 INFO L130 PetriNetUnfolder]: 5485/8396 cut-off events. [2022-12-13 00:38:34,883 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 00:38:34,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16776 conditions, 8396 events. 5485/8396 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 49493 event pairs, 1765 based on Foata normal form. 0/6566 useless extension candidates. Maximal degree in co-relation 16766. Up to 5233 conditions per place. [2022-12-13 00:38:34,930 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 42 selfloop transitions, 7 changer transitions 2/59 dead transitions. [2022-12-13 00:38:34,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 236 flow [2022-12-13 00:38:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:38:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:38:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-12-13 00:38:34,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2022-12-13 00:38:34,934 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 80 flow. Second operand 3 states and 76 transitions. [2022-12-13 00:38:34,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 236 flow [2022-12-13 00:38:34,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:38:34,937 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 128 flow [2022-12-13 00:38:34,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-13 00:38:34,938 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -26 predicate places. [2022-12-13 00:38:34,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:34,938 INFO L89 Accepts]: Start accepts. Operand has 46 places, 40 transitions, 128 flow [2022-12-13 00:38:34,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:34,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:34,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 128 flow [2022-12-13 00:38:34,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 128 flow [2022-12-13 00:38:34,965 INFO L130 PetriNetUnfolder]: 72/313 cut-off events. [2022-12-13 00:38:34,966 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 00:38:34,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 313 events. 72/313 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2114 event pairs, 36 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 510. Up to 117 conditions per place. [2022-12-13 00:38:34,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 128 flow [2022-12-13 00:38:34,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 00:38:34,984 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:34,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 00:38:34,986 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 128 flow [2022-12-13 00:38:34,986 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 00:38:34,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:34,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:34,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:38:34,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1099673807, now seen corresponding path program 1 times [2022-12-13 00:38:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:34,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815810570] [2022-12-13 00:38:34,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:34,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:35,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:35,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815810570] [2022-12-13 00:38:35,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815810570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:35,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:35,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:38:35,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605997215] [2022-12-13 00:38:35,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:35,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:38:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:38:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:38:35,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:38:35,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:35,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:35,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:38:35,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:35,855 INFO L130 PetriNetUnfolder]: 3884/6131 cut-off events. [2022-12-13 00:38:35,856 INFO L131 PetriNetUnfolder]: For 2017/2017 co-relation queries the response was YES. [2022-12-13 00:38:35,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14299 conditions, 6131 events. 3884/6131 cut-off events. For 2017/2017 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 35553 event pairs, 1760 based on Foata normal form. 108/5112 useless extension candidates. Maximal degree in co-relation 14287. Up to 2687 conditions per place. [2022-12-13 00:38:35,886 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 54 selfloop transitions, 8 changer transitions 1/71 dead transitions. [2022-12-13 00:38:35,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 342 flow [2022-12-13 00:38:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:38:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:38:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 00:38:35,890 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2022-12-13 00:38:35,890 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 128 flow. Second operand 4 states and 92 transitions. [2022-12-13 00:38:35,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 342 flow [2022-12-13 00:38:35,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:38:35,899 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 170 flow [2022-12-13 00:38:35,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-13 00:38:35,901 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2022-12-13 00:38:35,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:35,902 INFO L89 Accepts]: Start accepts. Operand has 49 places, 43 transitions, 170 flow [2022-12-13 00:38:35,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:35,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:35,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 43 transitions, 170 flow [2022-12-13 00:38:35,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 170 flow [2022-12-13 00:38:35,923 INFO L130 PetriNetUnfolder]: 57/265 cut-off events. [2022-12-13 00:38:35,923 INFO L131 PetriNetUnfolder]: For 98/105 co-relation queries the response was YES. [2022-12-13 00:38:35,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 265 events. 57/265 cut-off events. For 98/105 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1692 event pairs, 26 based on Foata normal form. 1/188 useless extension candidates. Maximal degree in co-relation 499. Up to 96 conditions per place. [2022-12-13 00:38:35,926 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 170 flow [2022-12-13 00:38:35,926 INFO L226 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-13 00:38:35,935 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:35,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 00:38:35,937 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 170 flow [2022-12-13 00:38:35,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:35,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:35,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:35,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:38:35,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:35,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1754712819, now seen corresponding path program 1 times [2022-12-13 00:38:35,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:35,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995774379] [2022-12-13 00:38:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:36,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:36,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995774379] [2022-12-13 00:38:36,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995774379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:36,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:36,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:38:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177401785] [2022-12-13 00:38:36,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:36,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:38:36,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:36,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:38:36,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:38:36,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:38:36,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 170 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 00:38:36,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:36,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:38:36,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:36,607 INFO L130 PetriNetUnfolder]: 3229/5099 cut-off events. [2022-12-13 00:38:36,608 INFO L131 PetriNetUnfolder]: For 3583/3583 co-relation queries the response was YES. [2022-12-13 00:38:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12768 conditions, 5099 events. 3229/5099 cut-off events. For 3583/3583 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 28325 event pairs, 755 based on Foata normal form. 48/4339 useless extension candidates. Maximal degree in co-relation 12753. Up to 2397 conditions per place. [2022-12-13 00:38:36,638 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 51 selfloop transitions, 10 changer transitions 0/69 dead transitions. [2022-12-13 00:38:36,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 69 transitions, 374 flow [2022-12-13 00:38:36,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:38:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:38:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 00:38:36,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 00:38:36,639 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 170 flow. Second operand 4 states and 84 transitions. [2022-12-13 00:38:36,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 69 transitions, 374 flow [2022-12-13 00:38:36,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:38:36,646 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 246 flow [2022-12-13 00:38:36,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-13 00:38:36,647 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2022-12-13 00:38:36,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:36,647 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 246 flow [2022-12-13 00:38:36,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:36,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:36,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 246 flow [2022-12-13 00:38:36,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 246 flow [2022-12-13 00:38:36,666 INFO L130 PetriNetUnfolder]: 39/200 cut-off events. [2022-12-13 00:38:36,666 INFO L131 PetriNetUnfolder]: For 157/159 co-relation queries the response was YES. [2022-12-13 00:38:36,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 200 events. 39/200 cut-off events. For 157/159 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1141 event pairs, 14 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 454. Up to 70 conditions per place. [2022-12-13 00:38:36,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 246 flow [2022-12-13 00:38:36,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-13 00:38:36,671 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:36,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 00:38:36,672 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 246 flow [2022-12-13 00:38:36,673 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 00:38:36,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:36,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:36,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:38:36,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:36,674 INFO L85 PathProgramCache]: Analyzing trace with hash 716020303, now seen corresponding path program 1 times [2022-12-13 00:38:36,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:36,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446299333] [2022-12-13 00:38:36,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:36,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446299333] [2022-12-13 00:38:36,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446299333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:36,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:36,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:38:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403025435] [2022-12-13 00:38:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:36,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:38:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:38:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:38:36,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 00:38:36,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:36,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:36,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 00:38:36,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:37,283 INFO L130 PetriNetUnfolder]: 3205/5174 cut-off events. [2022-12-13 00:38:37,283 INFO L131 PetriNetUnfolder]: For 3675/3730 co-relation queries the response was YES. [2022-12-13 00:38:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12431 conditions, 5174 events. 3205/5174 cut-off events. For 3675/3730 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 31805 event pairs, 974 based on Foata normal form. 81/3555 useless extension candidates. Maximal degree in co-relation 12412. Up to 4825 conditions per place. [2022-12-13 00:38:37,314 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 41 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2022-12-13 00:38:37,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 430 flow [2022-12-13 00:38:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:38:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:38:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 00:38:37,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7171717171717171 [2022-12-13 00:38:37,317 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 246 flow. Second operand 3 states and 71 transitions. [2022-12-13 00:38:37,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 430 flow [2022-12-13 00:38:37,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:38:37,323 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 310 flow [2022-12-13 00:38:37,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 00:38:37,325 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2022-12-13 00:38:37,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:37,326 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 310 flow [2022-12-13 00:38:37,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:37,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:37,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 310 flow [2022-12-13 00:38:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 56 transitions, 310 flow [2022-12-13 00:38:37,442 INFO L130 PetriNetUnfolder]: 804/1757 cut-off events. [2022-12-13 00:38:37,442 INFO L131 PetriNetUnfolder]: For 721/786 co-relation queries the response was YES. [2022-12-13 00:38:37,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3808 conditions, 1757 events. 804/1757 cut-off events. For 721/786 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 14314 event pairs, 408 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 3790. Up to 1261 conditions per place. [2022-12-13 00:38:37,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 56 transitions, 310 flow [2022-12-13 00:38:37,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-13 00:38:37,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:37,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 00:38:37,482 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 310 flow [2022-12-13 00:38:37,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:37,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:37,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:37,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:38:37,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash -484708460, now seen corresponding path program 1 times [2022-12-13 00:38:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:37,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477773871] [2022-12-13 00:38:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:37,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477773871] [2022-12-13 00:38:37,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477773871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:37,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:37,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:38:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936420470] [2022-12-13 00:38:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:37,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:38:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:38:37,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:38:37,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 00:38:37,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 310 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:37,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:37,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 00:38:37,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:38,016 INFO L130 PetriNetUnfolder]: 1618/3035 cut-off events. [2022-12-13 00:38:38,016 INFO L131 PetriNetUnfolder]: For 2075/2100 co-relation queries the response was YES. [2022-12-13 00:38:38,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9238 conditions, 3035 events. 1618/3035 cut-off events. For 2075/2100 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 20051 event pairs, 233 based on Foata normal form. 213/2305 useless extension candidates. Maximal degree in co-relation 9217. Up to 2116 conditions per place. [2022-12-13 00:38:38,034 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 51 selfloop transitions, 19 changer transitions 0/89 dead transitions. [2022-12-13 00:38:38,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 592 flow [2022-12-13 00:38:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:38:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:38:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-13 00:38:38,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2022-12-13 00:38:38,036 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 310 flow. Second operand 4 states and 97 transitions. [2022-12-13 00:38:38,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 592 flow [2022-12-13 00:38:38,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:38:38,043 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 412 flow [2022-12-13 00:38:38,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2022-12-13 00:38:38,046 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2022-12-13 00:38:38,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:38,046 INFO L89 Accepts]: Start accepts. Operand has 58 places, 65 transitions, 412 flow [2022-12-13 00:38:38,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:38,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:38,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 65 transitions, 412 flow [2022-12-13 00:38:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 65 transitions, 412 flow [2022-12-13 00:38:38,154 INFO L130 PetriNetUnfolder]: 459/1208 cut-off events. [2022-12-13 00:38:38,154 INFO L131 PetriNetUnfolder]: For 595/1329 co-relation queries the response was YES. [2022-12-13 00:38:38,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 1208 events. 459/1208 cut-off events. For 595/1329 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 9829 event pairs, 105 based on Foata normal form. 12/711 useless extension candidates. Maximal degree in co-relation 3622. Up to 847 conditions per place. [2022-12-13 00:38:38,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 65 transitions, 412 flow [2022-12-13 00:38:38,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-13 00:38:38,177 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:38,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 00:38:38,178 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 412 flow [2022-12-13 00:38:38,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:38,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:38,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:38,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:38:38,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:38,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash 94677071, now seen corresponding path program 1 times [2022-12-13 00:38:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:38,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275748109] [2022-12-13 00:38:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:38,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275748109] [2022-12-13 00:38:38,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275748109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:38,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:38,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:38:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297397257] [2022-12-13 00:38:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:38:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:38:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:38:38,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:38:38,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 412 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 00:38:38,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:38,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:38:38,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:38,835 INFO L130 PetriNetUnfolder]: 2219/4117 cut-off events. [2022-12-13 00:38:38,835 INFO L131 PetriNetUnfolder]: For 6675/7109 co-relation queries the response was YES. [2022-12-13 00:38:38,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15548 conditions, 4117 events. 2219/4117 cut-off events. For 6675/7109 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 28385 event pairs, 346 based on Foata normal form. 325/3770 useless extension candidates. Maximal degree in co-relation 15525. Up to 2129 conditions per place. [2022-12-13 00:38:38,861 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 96 selfloop transitions, 23 changer transitions 2/135 dead transitions. [2022-12-13 00:38:38,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 1045 flow [2022-12-13 00:38:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:38:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:38:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-13 00:38:38,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2022-12-13 00:38:38,862 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 412 flow. Second operand 5 states and 117 transitions. [2022-12-13 00:38:38,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 1045 flow [2022-12-13 00:38:38,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 135 transitions, 951 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-13 00:38:38,873 INFO L231 Difference]: Finished difference. Result has 63 places, 76 transitions, 555 flow [2022-12-13 00:38:38,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=555, PETRI_PLACES=63, PETRI_TRANSITIONS=76} [2022-12-13 00:38:38,874 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2022-12-13 00:38:38,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:38,874 INFO L89 Accepts]: Start accepts. Operand has 63 places, 76 transitions, 555 flow [2022-12-13 00:38:38,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:38,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:38,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 76 transitions, 555 flow [2022-12-13 00:38:38,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 76 transitions, 555 flow [2022-12-13 00:38:38,989 INFO L130 PetriNetUnfolder]: 623/1640 cut-off events. [2022-12-13 00:38:38,990 INFO L131 PetriNetUnfolder]: For 1105/1252 co-relation queries the response was YES. [2022-12-13 00:38:38,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 1640 events. 623/1640 cut-off events. For 1105/1252 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 14345 event pairs, 84 based on Foata normal form. 15/963 useless extension candidates. Maximal degree in co-relation 4417. Up to 1135 conditions per place. [2022-12-13 00:38:39,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 76 transitions, 555 flow [2022-12-13 00:38:39,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 1206 [2022-12-13 00:38:39,063 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:39,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-13 00:38:39,064 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 555 flow [2022-12-13 00:38:39,064 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 00:38:39,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:39,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:39,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:38:39,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:39,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1901651752, now seen corresponding path program 1 times [2022-12-13 00:38:39,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:39,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596868851] [2022-12-13 00:38:39,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596868851] [2022-12-13 00:38:39,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596868851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:39,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:39,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:39,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364712766] [2022-12-13 00:38:39,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:39,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:38:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:39,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:38:39,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:38:39,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:38:39,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 76 transitions, 555 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:39,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:39,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:38:39,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:39,798 INFO L130 PetriNetUnfolder]: 3083/5662 cut-off events. [2022-12-13 00:38:39,799 INFO L131 PetriNetUnfolder]: For 14281/14734 co-relation queries the response was YES. [2022-12-13 00:38:39,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21206 conditions, 5662 events. 3083/5662 cut-off events. For 14281/14734 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 41649 event pairs, 555 based on Foata normal form. 397/5088 useless extension candidates. Maximal degree in co-relation 21180. Up to 2690 conditions per place. [2022-12-13 00:38:39,827 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 96 selfloop transitions, 22 changer transitions 30/162 dead transitions. [2022-12-13 00:38:39,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 162 transitions, 1267 flow [2022-12-13 00:38:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:38:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:38:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2022-12-13 00:38:39,828 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.702020202020202 [2022-12-13 00:38:39,828 INFO L175 Difference]: Start difference. First operand has 63 places, 76 transitions, 555 flow. Second operand 6 states and 139 transitions. [2022-12-13 00:38:39,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 162 transitions, 1267 flow [2022-12-13 00:38:39,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 162 transitions, 1261 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 00:38:39,842 INFO L231 Difference]: Finished difference. Result has 69 places, 71 transitions, 540 flow [2022-12-13 00:38:39,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2022-12-13 00:38:39,843 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2022-12-13 00:38:39,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:39,843 INFO L89 Accepts]: Start accepts. Operand has 69 places, 71 transitions, 540 flow [2022-12-13 00:38:39,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:39,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:39,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 71 transitions, 540 flow [2022-12-13 00:38:39,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 71 transitions, 540 flow [2022-12-13 00:38:39,947 INFO L130 PetriNetUnfolder]: 596/1572 cut-off events. [2022-12-13 00:38:39,947 INFO L131 PetriNetUnfolder]: For 1545/1946 co-relation queries the response was YES. [2022-12-13 00:38:39,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4412 conditions, 1572 events. 596/1572 cut-off events. For 1545/1946 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 13751 event pairs, 94 based on Foata normal form. 15/888 useless extension candidates. Maximal degree in co-relation 4386. Up to 1108 conditions per place. [2022-12-13 00:38:39,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 71 transitions, 540 flow [2022-12-13 00:38:39,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-13 00:38:39,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:38:39,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 00:38:39,969 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 540 flow [2022-12-13 00:38:39,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:39,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:39,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:39,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:38:39,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:39,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1241128600, now seen corresponding path program 2 times [2022-12-13 00:38:39,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:39,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164207665] [2022-12-13 00:38:39,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:40,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164207665] [2022-12-13 00:38:40,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164207665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:40,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:40,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:38:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557598794] [2022-12-13 00:38:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:40,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:38:40,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:38:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:38:40,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 00:38:40,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:40,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:40,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 00:38:40,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:40,391 INFO L130 PetriNetUnfolder]: 1158/2263 cut-off events. [2022-12-13 00:38:40,391 INFO L131 PetriNetUnfolder]: For 4207/4301 co-relation queries the response was YES. [2022-12-13 00:38:40,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8045 conditions, 2263 events. 1158/2263 cut-off events. For 4207/4301 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14603 event pairs, 87 based on Foata normal form. 279/1706 useless extension candidates. Maximal degree in co-relation 8016. Up to 928 conditions per place. [2022-12-13 00:38:40,401 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 32 selfloop transitions, 28 changer transitions 23/98 dead transitions. [2022-12-13 00:38:40,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 871 flow [2022-12-13 00:38:40,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:38:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:38:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 00:38:40,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 00:38:40,402 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 540 flow. Second operand 5 states and 106 transitions. [2022-12-13 00:38:40,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 871 flow [2022-12-13 00:38:40,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 780 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-13 00:38:40,410 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 422 flow [2022-12-13 00:38:40,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2022-12-13 00:38:40,411 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2022-12-13 00:38:40,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:40,411 INFO L89 Accepts]: Start accepts. Operand has 66 places, 59 transitions, 422 flow [2022-12-13 00:38:40,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:40,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:40,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 59 transitions, 422 flow [2022-12-13 00:38:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 422 flow [2022-12-13 00:38:40,452 INFO L130 PetriNetUnfolder]: 219/607 cut-off events. [2022-12-13 00:38:40,453 INFO L131 PetriNetUnfolder]: For 426/529 co-relation queries the response was YES. [2022-12-13 00:38:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2173 conditions, 607 events. 219/607 cut-off events. For 426/529 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 4454 event pairs, 2 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 2150. Up to 415 conditions per place. [2022-12-13 00:38:40,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 422 flow [2022-12-13 00:38:40,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 00:38:40,986 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:38:40,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 576 [2022-12-13 00:38:40,987 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 418 flow [2022-12-13 00:38:40,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:40,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:40,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:40,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:38:40,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2076033669, now seen corresponding path program 1 times [2022-12-13 00:38:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622465935] [2022-12-13 00:38:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622465935] [2022-12-13 00:38:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622465935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:41,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:41,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:38:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930986612] [2022-12-13 00:38:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:41,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:38:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:41,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:38:41,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:38:41,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:38:41,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 418 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:41,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:41,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:38:41,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:41,367 INFO L130 PetriNetUnfolder]: 931/1734 cut-off events. [2022-12-13 00:38:41,367 INFO L131 PetriNetUnfolder]: For 4370/4496 co-relation queries the response was YES. [2022-12-13 00:38:41,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 1734 events. 931/1734 cut-off events. For 4370/4496 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 10372 event pairs, 223 based on Foata normal form. 103/1457 useless extension candidates. Maximal degree in co-relation 7260. Up to 801 conditions per place. [2022-12-13 00:38:41,376 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 37 selfloop transitions, 3 changer transitions 34/86 dead transitions. [2022-12-13 00:38:41,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 86 transitions, 756 flow [2022-12-13 00:38:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:38:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:38:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 00:38:41,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-13 00:38:41,377 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 418 flow. Second operand 4 states and 71 transitions. [2022-12-13 00:38:41,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 86 transitions, 756 flow [2022-12-13 00:38:41,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 610 flow, removed 35 selfloop flow, removed 6 redundant places. [2022-12-13 00:38:41,406 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 241 flow [2022-12-13 00:38:41,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2022-12-13 00:38:41,407 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2022-12-13 00:38:41,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:41,407 INFO L89 Accepts]: Start accepts. Operand has 60 places, 47 transitions, 241 flow [2022-12-13 00:38:41,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:41,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:41,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 47 transitions, 241 flow [2022-12-13 00:38:41,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 241 flow [2022-12-13 00:38:41,428 INFO L130 PetriNetUnfolder]: 101/239 cut-off events. [2022-12-13 00:38:41,428 INFO L131 PetriNetUnfolder]: For 427/457 co-relation queries the response was YES. [2022-12-13 00:38:41,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 239 events. 101/239 cut-off events. For 427/457 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1146 event pairs, 2 based on Foata normal form. 9/112 useless extension candidates. Maximal degree in co-relation 692. Up to 118 conditions per place. [2022-12-13 00:38:41,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 47 transitions, 241 flow [2022-12-13 00:38:41,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-13 00:38:41,601 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:38:41,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-13 00:38:41,602 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 233 flow [2022-12-13 00:38:41,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:41,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:41,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:38:41,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1361362762, now seen corresponding path program 1 times [2022-12-13 00:38:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:41,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058329432] [2022-12-13 00:38:41,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:38:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:38:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:38:42,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058329432] [2022-12-13 00:38:42,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058329432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:38:42,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:38:42,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:38:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490783763] [2022-12-13 00:38:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:38:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:38:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:38:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:38:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:38:42,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 00:38:42,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 233 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:42,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:38:42,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 00:38:42,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:38:42,494 INFO L130 PetriNetUnfolder]: 324/638 cut-off events. [2022-12-13 00:38:42,494 INFO L131 PetriNetUnfolder]: For 1209/1231 co-relation queries the response was YES. [2022-12-13 00:38:42,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 638 events. 324/638 cut-off events. For 1209/1231 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3397 event pairs, 15 based on Foata normal form. 42/512 useless extension candidates. Maximal degree in co-relation 2174. Up to 252 conditions per place. [2022-12-13 00:38:42,496 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 34 selfloop transitions, 3 changer transitions 36/84 dead transitions. [2022-12-13 00:38:42,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 583 flow [2022-12-13 00:38:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:38:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:38:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 00:38:42,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-13 00:38:42,498 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 233 flow. Second operand 6 states and 81 transitions. [2022-12-13 00:38:42,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 583 flow [2022-12-13 00:38:42,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 84 transitions, 549 flow, removed 4 selfloop flow, removed 9 redundant places. [2022-12-13 00:38:42,504 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 219 flow [2022-12-13 00:38:42,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-13 00:38:42,504 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2022-12-13 00:38:42,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:38:42,505 INFO L89 Accepts]: Start accepts. Operand has 51 places, 43 transitions, 219 flow [2022-12-13 00:38:42,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:38:42,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:38:42,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 219 flow [2022-12-13 00:38:42,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 219 flow [2022-12-13 00:38:42,522 INFO L130 PetriNetUnfolder]: 90/213 cut-off events. [2022-12-13 00:38:42,522 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-12-13 00:38:42,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 213 events. 90/213 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1079 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 621. Up to 109 conditions per place. [2022-12-13 00:38:42,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 43 transitions, 219 flow [2022-12-13 00:38:42,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-13 00:38:42,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] $Ultimate##0-->L797: Formula: (and (= v_~y$r_buff0_thd0~0_146 v_~y$r_buff1_thd0~0_153) (= v_~y$r_buff0_thd2~0_142 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_473 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_435 256))))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|) (= v_~y$r_buff0_thd3~0_127 v_~y$r_buff1_thd3~0_124) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37| 0)) (= v_~y$w_buff0_used~0_474 v_~y$w_buff1_used~0_435) (= v_~y$r_buff0_thd1~0_221 v_~y$r_buff1_thd1~0_231) (= v_~y$w_buff0~0_312 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= v_~z~0_169 1) (= v_~y$w_buff1~0_278 v_~y$w_buff0~0_313) (= v_~y$w_buff0_used~0_473 1) (= v_~y$r_buff0_thd2~0_143 v_~y$r_buff1_thd2~0_115) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|)) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_474, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_127, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$w_buff0~0=v_~y$w_buff0~0_313, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_143, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_221, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_37|, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_473, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_37|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_115, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_231, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_127, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$w_buff0~0=v_~y$w_buff0~0_312, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_221, ~z~0=v_~z~0_169, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_435} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [364] $Ultimate##0-->L814: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= 2 v_~z~0_9)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~z~0=v_~z~0_9} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~z~0] [2022-12-13 00:38:43,157 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:38:43,158 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 654 [2022-12-13 00:38:43,158 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 211 flow [2022-12-13 00:38:43,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:38:43,158 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:38:43,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:43,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:38:43,158 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:38:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:38:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1532778367, now seen corresponding path program 1 times [2022-12-13 00:38:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:38:43,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741911493] [2022-12-13 00:38:43,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:38:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:38:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:38:43,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:38:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:38:43,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:38:43,254 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:38:43,256 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:38:43,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:38:43,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:38:43,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:38:43,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:38:43,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:38:43,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:38:43,260 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:38:43,266 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:38:43,266 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:38:43,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:38:43 BasicIcfg [2022-12-13 00:38:43,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:38:43,349 INFO L158 Benchmark]: Toolchain (without parser) took 18693.05ms. Allocated memory was 197.1MB in the beginning and 975.2MB in the end (delta: 778.0MB). Free memory was 170.9MB in the beginning and 626.8MB in the end (delta: -455.9MB). Peak memory consumption was 323.4MB. Max. memory is 8.0GB. [2022-12-13 00:38:43,349 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory was 173.5MB in the beginning and 173.4MB in the end (delta: 104.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:38:43,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.38ms. Allocated memory is still 197.1MB. Free memory was 170.6MB in the beginning and 143.8MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:38:43,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.83ms. Allocated memory is still 197.1MB. Free memory was 143.8MB in the beginning and 141.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:38:43,350 INFO L158 Benchmark]: Boogie Preprocessor took 51.28ms. Allocated memory is still 197.1MB. Free memory was 141.2MB in the beginning and 139.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:38:43,350 INFO L158 Benchmark]: RCFGBuilder took 698.44ms. Allocated memory is still 197.1MB. Free memory was 139.6MB in the beginning and 107.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 00:38:43,350 INFO L158 Benchmark]: TraceAbstraction took 17330.56ms. Allocated memory was 197.1MB in the beginning and 975.2MB in the end (delta: 778.0MB). Free memory was 106.1MB in the beginning and 626.8MB in the end (delta: -520.7MB). Peak memory consumption was 258.3MB. Max. memory is 8.0GB. [2022-12-13 00:38:43,351 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.11ms. Allocated memory is still 197.1MB. Free memory was 173.5MB in the beginning and 173.4MB in the end (delta: 104.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 533.38ms. Allocated memory is still 197.1MB. Free memory was 170.6MB in the beginning and 143.8MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.83ms. Allocated memory is still 197.1MB. Free memory was 143.8MB in the beginning and 141.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.28ms. Allocated memory is still 197.1MB. Free memory was 141.2MB in the beginning and 139.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 698.44ms. Allocated memory is still 197.1MB. Free memory was 139.6MB in the beginning and 107.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17330.56ms. Allocated memory was 197.1MB in the beginning and 975.2MB in the end (delta: 778.0MB). Free memory was 106.1MB in the beginning and 626.8MB in the end (delta: -520.7MB). Peak memory consumption was 258.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 118 PlacesBefore, 72 PlacesAfterwards, 110 TransitionsBefore, 62 TransitionsAfterwards, 2112 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3452, independent: 3282, independent conditional: 3282, independent unconditional: 0, dependent: 170, dependent conditional: 170, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3452, independent: 3282, independent conditional: 0, independent unconditional: 3282, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3452, independent: 3282, independent conditional: 0, independent unconditional: 3282, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3452, independent: 3282, independent conditional: 0, independent unconditional: 3282, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1947, independent: 1883, independent conditional: 0, independent unconditional: 1883, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1947, independent: 1852, independent conditional: 0, independent unconditional: 1852, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 319, dependent conditional: 0, dependent unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3452, independent: 1399, independent conditional: 0, independent unconditional: 1399, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 1947, unknown conditional: 0, unknown unconditional: 1947] , Statistics on independence cache: Total cache size (in pairs): 3603, Positive cache size: 3539, Positive conditional cache size: 0, Positive unconditional cache size: 3539, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 372, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 372, independent: 334, independent conditional: 19, independent unconditional: 315, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 372, independent: 334, independent conditional: 19, independent unconditional: 315, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 372, independent: 334, independent conditional: 19, independent unconditional: 315, dependent: 38, dependent conditional: 5, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 291, independent: 264, independent conditional: 15, independent unconditional: 249, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 291, independent: 237, independent conditional: 0, independent unconditional: 237, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 114, dependent conditional: 17, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 372, independent: 70, independent conditional: 4, independent unconditional: 66, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 291, unknown conditional: 17, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 264, Positive conditional cache size: 15, Positive unconditional cache size: 249, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 230, independent: 208, independent conditional: 31, independent unconditional: 177, dependent: 22, dependent conditional: 13, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 208, independent conditional: 2, independent unconditional: 206, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 208, independent conditional: 2, independent unconditional: 206, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 189, independent conditional: 2, independent unconditional: 187, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 283, Positive conditional cache size: 15, Positive unconditional cache size: 268, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 199, independent: 174, independent conditional: 174, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 199, independent: 174, independent conditional: 31, independent unconditional: 143, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 199, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 199, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 199, independent: 173, independent conditional: 0, independent unconditional: 173, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 313, Positive cache size: 284, Positive conditional cache size: 15, Positive unconditional cache size: 269, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 822 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 232, independent conditional: 232, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 232, independent conditional: 25, independent unconditional: 207, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 286, Positive conditional cache size: 15, Positive unconditional cache size: 271, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 127, independent conditional: 9, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 127, independent conditional: 9, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 127, independent conditional: 9, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 155, independent: 127, independent conditional: 9, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 286, Positive conditional cache size: 15, Positive unconditional cache size: 271, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 162, independent conditional: 9, independent unconditional: 153, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 162, independent conditional: 9, independent unconditional: 153, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 162, independent conditional: 9, independent unconditional: 153, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 196, independent: 159, independent conditional: 9, independent unconditional: 150, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 289, Positive conditional cache size: 15, Positive unconditional cache size: 274, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 48, independent conditional: 1, independent unconditional: 47, dependent: 40, dependent conditional: 1, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 297, Positive conditional cache size: 15, Positive unconditional cache size: 282, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176, independent: 139, independent conditional: 139, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176, independent: 139, independent conditional: 60, independent unconditional: 79, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 176, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 300, Positive conditional cache size: 15, Positive unconditional cache size: 285, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 64 PlacesBefore, 62 PlacesAfterwards, 59 TransitionsBefore, 57 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 120, independent conditional: 60, independent unconditional: 60, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 310, Positive conditional cache size: 15, Positive unconditional cache size: 295, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 56 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 44 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, independent: 380, independent conditional: 380, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 426, independent: 380, independent conditional: 182, independent unconditional: 198, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 426, independent: 380, independent conditional: 162, independent unconditional: 218, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 426, independent: 380, independent conditional: 162, independent unconditional: 218, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 42, independent conditional: 20, independent unconditional: 22, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 426, independent: 338, independent conditional: 142, independent unconditional: 196, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 44, unknown conditional: 20, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 402, Positive conditional cache size: 37, Positive unconditional cache size: 365, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 48 PlacesBefore, 45 PlacesAfterwards, 43 TransitionsBefore, 40 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 67, independent conditional: 27, independent unconditional: 40, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, independent: 67, independent conditional: 27, independent unconditional: 40, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, independent: 67, independent conditional: 27, independent unconditional: 40, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 105, independent: 66, independent conditional: 26, independent unconditional: 40, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 428, Positive conditional cache size: 38, Positive unconditional cache size: 390, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=-2, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=-1, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 [L796] 2 z = 1 [L813] 2 z = 2 [L816] 2 __unbuffered_p2_EAX = z [L819] 2 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 19]: 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: 847]: 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: 849]: 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: 845]: 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, 142 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: 17.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 931 IncrementalHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 36 mSDtfsCounter, 931 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=555occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 998 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:38:43,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...