/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:16:46,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:16:46,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:16:46,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:16:46,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:16:46,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:16:46,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:16:46,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:16:46,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:16:46,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:16:46,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:16:46,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:16:46,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:16:46,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:16:46,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:16:46,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:16:46,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:16:46,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:16:46,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:16:46,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:16:46,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:16:46,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:16:46,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:16:46,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:16:46,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:16:46,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:16:46,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:16:46,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:16:46,347 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:16:46,348 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:16:46,348 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:16:46,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:16:46,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:16:46,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:16:46,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:16:46,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:16:46,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:16:46,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:16:46,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:16:46,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:16:46,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:16:46,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:16:46,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:16:46,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:16:46,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:16:46,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:16:46,400 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:16:46,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:16:46,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:16:46,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:16:46,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:16:46,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:16:46,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:16:46,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:16:46,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:16:46,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:16:46,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:16:46,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:16:46,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:16:46,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:16:46,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:16:46,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:16:46,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:16:46,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:46,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:16:46,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:16:46,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:16:46,405 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:16:46,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:16:46,405 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:16:46,405 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:16:46,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:16:46,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:16:46,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:16:46,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:16:46,740 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:16:46,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:16:47,844 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:16:48,199 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:16:48,204 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:16:48,258 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884b7be14/fbba8d134ddc4112885120d4a7eeee2e/FLAG7f8736acc [2022-12-06 06:16:48,271 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/884b7be14/fbba8d134ddc4112885120d4a7eeee2e [2022-12-06 06:16:48,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:16:48,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:16:48,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:48,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:16:48,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:16:48,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@349ecaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48, skipping insertion in model container [2022-12-06 06:16:48,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:16:48,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:16:48,514 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/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:16:48,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:48,719 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:16:48,730 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/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:16:48,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:48,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:48,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:48,837 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:16:48,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48 WrapperNode [2022-12-06 06:16:48,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:48,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:48,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:16:48,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:16:48,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,910 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-06 06:16:48,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:48,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:16:48,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:16:48,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:16:48,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:16:48,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:16:48,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:16:48,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:16:48,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (1/1) ... [2022-12-06 06:16:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:48,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:48,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:16:49,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:16:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:16:49,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:16:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:16:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:16:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:16:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:16:49,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:16:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:16:49,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:16:49,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:16:49,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:16:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:16:49,046 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:16:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:16:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:16:49,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:16:49,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:16:49,049 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:16:49,250 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:16:49,252 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:16:49,604 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:16:49,742 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:16:49,743 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:16:49,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:49 BoogieIcfgContainer [2022-12-06 06:16:49,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:16:49,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:16:49,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:16:49,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:16:49,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:16:48" (1/3) ... [2022-12-06 06:16:49,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65006d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:49, skipping insertion in model container [2022-12-06 06:16:49,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:48" (2/3) ... [2022-12-06 06:16:49,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65006d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:49, skipping insertion in model container [2022-12-06 06:16:49,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:49" (3/3) ... [2022-12-06 06:16:49,758 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:16:49,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:16:49,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:16:49,778 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:16:49,837 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:16:49,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:16:49,965 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:16:49,965 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:49,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:16:49,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:16:49,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:49,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:50,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:50,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:50,057 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:16:50,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:50,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:16:50,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:16:50,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 3286 [2022-12-06 06:16:54,854 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 06:16:54,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:16:54,872 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;@334035fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:16:54,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:16:54,875 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:16:54,875 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:54,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:54,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:16:54,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 556263, now seen corresponding path program 1 times [2022-12-06 06:16:54,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:54,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607005011] [2022-12-06 06:16:54,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:55,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:55,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607005011] [2022-12-06 06:16:55,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607005011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:55,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:55,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097134829] [2022-12-06 06:16:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:55,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:55,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 06:16:55,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:55,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:55,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 06:16:55,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:56,180 INFO L130 PetriNetUnfolder]: 6050/8797 cut-off events. [2022-12-06 06:16:56,181 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 06:16:56,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17196 conditions, 8797 events. 6050/8797 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 54889 event pairs, 1106 based on Foata normal form. 0/8025 useless extension candidates. Maximal degree in co-relation 17184. Up to 6574 conditions per place. [2022-12-06 06:16:56,222 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 06:16:56,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-06 06:16:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 06:16:56,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-06 06:16:56,232 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 73 transitions. [2022-12-06 06:16:56,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 243 flow [2022-12-06 06:16:56,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:16:56,237 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 70 flow [2022-12-06 06:16:56,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-06 06:16:56,242 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 06:16:56,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:56,242 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 70 flow [2022-12-06 06:16:56,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:56,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:56,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 70 flow [2022-12-06 06:16:56,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-06 06:16:56,263 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:16:56,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:56,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:16:56,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-06 06:16:56,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-06 06:16:56,349 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:56,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 06:16:56,350 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-06 06:16:56,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:56,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:56,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:56,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:16:56,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash 192569130, now seen corresponding path program 1 times [2022-12-06 06:16:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:56,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893719491] [2022-12-06 06:16:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:56,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893719491] [2022-12-06 06:16:56,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893719491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:56,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:56,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321805213] [2022-12-06 06:16:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:56,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:56,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:56,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:56,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:16:56,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:56,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:56,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:16:56,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:58,612 INFO L130 PetriNetUnfolder]: 17555/23800 cut-off events. [2022-12-06 06:16:58,612 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2022-12-06 06:16:58,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48946 conditions, 23800 events. 17555/23800 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 125168 event pairs, 6475 based on Foata normal form. 548/24348 useless extension candidates. Maximal degree in co-relation 48936. Up to 16873 conditions per place. [2022-12-06 06:16:58,737 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 06:16:58,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-06 06:16:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:16:58,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 06:16:58,740 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 54 transitions. [2022-12-06 06:16:58,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-06 06:16:58,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:58,743 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2022-12-06 06:16:58,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 06:16:58,744 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-06 06:16:58,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:58,744 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 128 flow [2022-12-06 06:16:58,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:58,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:58,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 128 flow [2022-12-06 06:16:58,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 128 flow [2022-12-06 06:16:58,786 INFO L130 PetriNetUnfolder]: 260/652 cut-off events. [2022-12-06 06:16:58,786 INFO L131 PetriNetUnfolder]: For 58/69 co-relation queries the response was YES. [2022-12-06 06:16:58,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 652 events. 260/652 cut-off events. For 58/69 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4268 event pairs, 138 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 1233. Up to 365 conditions per place. [2022-12-06 06:16:58,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 128 flow [2022-12-06 06:16:58,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 06:16:58,829 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:58,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 06:16:58,831 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2022-12-06 06:16:58,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:58,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:58,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:58,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:16:58,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:16:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1674674022, now seen corresponding path program 1 times [2022-12-06 06:16:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:58,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774160975] [2022-12-06 06:16:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774160975] [2022-12-06 06:16:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774160975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:58,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:58,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005759610] [2022-12-06 06:16:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:58,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:58,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:16:58,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 128 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:58,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:58,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:16:58,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:01,050 INFO L130 PetriNetUnfolder]: 16219/22016 cut-off events. [2022-12-06 06:17:01,050 INFO L131 PetriNetUnfolder]: For 8711/8711 co-relation queries the response was YES. [2022-12-06 06:17:01,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54766 conditions, 22016 events. 16219/22016 cut-off events. For 8711/8711 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 111198 event pairs, 4633 based on Foata normal form. 280/22296 useless extension candidates. Maximal degree in co-relation 54754. Up to 11079 conditions per place. [2022-12-06 06:17:01,163 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-06 06:17:01,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 348 flow [2022-12-06 06:17:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 06:17:01,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2022-12-06 06:17:01,165 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 128 flow. Second operand 4 states and 61 transitions. [2022-12-06 06:17:01,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 348 flow [2022-12-06 06:17:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:01,206 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2022-12-06 06:17:01,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-06 06:17:01,207 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-06 06:17:01,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:01,207 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 180 flow [2022-12-06 06:17:01,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:01,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:01,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 180 flow [2022-12-06 06:17:01,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 180 flow [2022-12-06 06:17:01,240 INFO L130 PetriNetUnfolder]: 206/514 cut-off events. [2022-12-06 06:17:01,240 INFO L131 PetriNetUnfolder]: For 221/257 co-relation queries the response was YES. [2022-12-06 06:17:01,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 514 events. 206/514 cut-off events. For 221/257 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3030 event pairs, 86 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 1171. Up to 295 conditions per place. [2022-12-06 06:17:01,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 180 flow [2022-12-06 06:17:01,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 618 [2022-12-06 06:17:01,262 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:01,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-06 06:17:01,264 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2022-12-06 06:17:01,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:01,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:01,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:01,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:17:01,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:01,265 INFO L85 PathProgramCache]: Analyzing trace with hash 299277665, now seen corresponding path program 1 times [2022-12-06 06:17:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670520444] [2022-12-06 06:17:01,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:01,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670520444] [2022-12-06 06:17:01,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670520444] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:01,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220567797] [2022-12-06 06:17:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:01,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:01,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:17:01,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 180 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:01,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:01,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:17:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:04,004 INFO L130 PetriNetUnfolder]: 15885/21562 cut-off events. [2022-12-06 06:17:04,004 INFO L131 PetriNetUnfolder]: For 14707/14707 co-relation queries the response was YES. [2022-12-06 06:17:04,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56893 conditions, 21562 events. 15885/21562 cut-off events. For 14707/14707 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 112027 event pairs, 4179 based on Foata normal form. 48/21610 useless extension candidates. Maximal degree in co-relation 56878. Up to 14587 conditions per place. [2022-12-06 06:17:04,177 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 64 selfloop transitions, 18 changer transitions 0/82 dead transitions. [2022-12-06 06:17:04,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 474 flow [2022-12-06 06:17:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 06:17:04,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2022-12-06 06:17:04,181 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 4 states and 73 transitions. [2022-12-06 06:17:04,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 474 flow [2022-12-06 06:17:04,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:04,202 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 279 flow [2022-12-06 06:17:04,202 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-06 06:17:04,203 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2022-12-06 06:17:04,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:04,204 INFO L89 Accepts]: Start accepts. Operand has 50 places, 47 transitions, 279 flow [2022-12-06 06:17:04,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:04,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:04,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 279 flow [2022-12-06 06:17:04,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 279 flow [2022-12-06 06:17:04,246 INFO L130 PetriNetUnfolder]: 180/464 cut-off events. [2022-12-06 06:17:04,246 INFO L131 PetriNetUnfolder]: For 491/585 co-relation queries the response was YES. [2022-12-06 06:17:04,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 464 events. 180/464 cut-off events. For 491/585 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2689 event pairs, 81 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 1299. Up to 263 conditions per place. [2022-12-06 06:17:04,251 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 279 flow [2022-12-06 06:17:04,251 INFO L188 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-06 06:17:04,275 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:04,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 06:17:04,282 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 279 flow [2022-12-06 06:17:04,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:04,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:04,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:04,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:17:04,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 687710371, now seen corresponding path program 1 times [2022-12-06 06:17:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:04,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102104192] [2022-12-06 06:17:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:04,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102104192] [2022-12-06 06:17:04,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102104192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:04,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:04,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:17:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676814076] [2022-12-06 06:17:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:04,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:17:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:17:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:17:04,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 06:17:04,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:04,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:04,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 06:17:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:06,389 INFO L130 PetriNetUnfolder]: 11048/15909 cut-off events. [2022-12-06 06:17:06,390 INFO L131 PetriNetUnfolder]: For 15673/16197 co-relation queries the response was YES. [2022-12-06 06:17:06,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42981 conditions, 15909 events. 11048/15909 cut-off events. For 15673/16197 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 93734 event pairs, 3989 based on Foata normal form. 465/15867 useless extension candidates. Maximal degree in co-relation 42963. Up to 10115 conditions per place. [2022-12-06 06:17:06,645 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 46 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2022-12-06 06:17:06,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 455 flow [2022-12-06 06:17:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:17:06,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5977011494252874 [2022-12-06 06:17:06,647 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 279 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:17:06,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 455 flow [2022-12-06 06:17:06,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 455 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:17:06,682 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 296 flow [2022-12-06 06:17:06,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-06 06:17:06,684 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-06 06:17:06,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:06,684 INFO L89 Accepts]: Start accepts. Operand has 53 places, 47 transitions, 296 flow [2022-12-06 06:17:06,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:06,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:06,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 47 transitions, 296 flow [2022-12-06 06:17:06,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 47 transitions, 296 flow [2022-12-06 06:17:06,712 INFO L130 PetriNetUnfolder]: 151/413 cut-off events. [2022-12-06 06:17:06,712 INFO L131 PetriNetUnfolder]: For 509/603 co-relation queries the response was YES. [2022-12-06 06:17:06,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 413 events. 151/413 cut-off events. For 509/603 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2350 event pairs, 64 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 1211. Up to 224 conditions per place. [2022-12-06 06:17:06,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 47 transitions, 296 flow [2022-12-06 06:17:06,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-06 06:17:06,723 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:06,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 06:17:06,725 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 296 flow [2022-12-06 06:17:06,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:06,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:06,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:06,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:17:06,726 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1219305203, now seen corresponding path program 1 times [2022-12-06 06:17:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:06,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227259353] [2022-12-06 06:17:06,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:06,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227259353] [2022-12-06 06:17:06,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227259353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:06,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:06,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:17:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923846443] [2022-12-06 06:17:06,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:06,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:17:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:06,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:17:06,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:17:06,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:17:06,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:06,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:06,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:17:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:07,897 INFO L130 PetriNetUnfolder]: 6940/10396 cut-off events. [2022-12-06 06:17:07,898 INFO L131 PetriNetUnfolder]: For 8812/9302 co-relation queries the response was YES. [2022-12-06 06:17:07,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27072 conditions, 10396 events. 6940/10396 cut-off events. For 8812/9302 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 62824 event pairs, 1729 based on Foata normal form. 501/10521 useless extension candidates. Maximal degree in co-relation 27051. Up to 8353 conditions per place. [2022-12-06 06:17:08,002 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2022-12-06 06:17:08,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 488 flow [2022-12-06 06:17:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:17:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:17:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 06:17:08,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-06 06:17:08,004 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 296 flow. Second operand 3 states and 59 transitions. [2022-12-06 06:17:08,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 488 flow [2022-12-06 06:17:08,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:08,021 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 319 flow [2022-12-06 06:17:08,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-06 06:17:08,024 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2022-12-06 06:17:08,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:08,024 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 319 flow [2022-12-06 06:17:08,025 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:08,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:08,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 319 flow [2022-12-06 06:17:08,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 319 flow [2022-12-06 06:17:08,127 INFO L130 PetriNetUnfolder]: 523/1227 cut-off events. [2022-12-06 06:17:08,128 INFO L131 PetriNetUnfolder]: For 883/981 co-relation queries the response was YES. [2022-12-06 06:17:08,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3011 conditions, 1227 events. 523/1227 cut-off events. For 883/981 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9240 event pairs, 248 based on Foata normal form. 4/1137 useless extension candidates. Maximal degree in co-relation 2992. Up to 651 conditions per place. [2022-12-06 06:17:08,146 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 319 flow [2022-12-06 06:17:08,147 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 06:17:08,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:08,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 06:17:08,162 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 319 flow [2022-12-06 06:17:08,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:08,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:08,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:08,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:17:08,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -807473581, now seen corresponding path program 1 times [2022-12-06 06:17:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:08,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886783710] [2022-12-06 06:17:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886783710] [2022-12-06 06:17:08,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886783710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:08,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:08,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775627727] [2022-12-06 06:17:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:08,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:17:08,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 319 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:08,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:08,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:17:08,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:10,836 INFO L130 PetriNetUnfolder]: 14350/20471 cut-off events. [2022-12-06 06:17:10,837 INFO L131 PetriNetUnfolder]: For 29345/29345 co-relation queries the response was YES. [2022-12-06 06:17:10,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66880 conditions, 20471 events. 14350/20471 cut-off events. For 29345/29345 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 118712 event pairs, 1440 based on Foata normal form. 168/20639 useless extension candidates. Maximal degree in co-relation 66858. Up to 7800 conditions per place. [2022-12-06 06:17:10,994 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 101 selfloop transitions, 31 changer transitions 17/149 dead transitions. [2022-12-06 06:17:10,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 149 transitions, 1093 flow [2022-12-06 06:17:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 06:17:10,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2022-12-06 06:17:10,996 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 319 flow. Second operand 6 states and 107 transitions. [2022-12-06 06:17:10,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 149 transitions, 1093 flow [2022-12-06 06:17:11,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 149 transitions, 1074 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:17:11,087 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 563 flow [2022-12-06 06:17:11,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=563, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2022-12-06 06:17:11,088 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-06 06:17:11,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:11,088 INFO L89 Accepts]: Start accepts. Operand has 61 places, 66 transitions, 563 flow [2022-12-06 06:17:11,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:11,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:11,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 66 transitions, 563 flow [2022-12-06 06:17:11,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 563 flow [2022-12-06 06:17:11,235 INFO L130 PetriNetUnfolder]: 779/1824 cut-off events. [2022-12-06 06:17:11,236 INFO L131 PetriNetUnfolder]: For 2226/2386 co-relation queries the response was YES. [2022-12-06 06:17:11,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 1824 events. 779/1824 cut-off events. For 2226/2386 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 14960 event pairs, 358 based on Foata normal form. 4/1687 useless extension candidates. Maximal degree in co-relation 4607. Up to 1043 conditions per place. [2022-12-06 06:17:11,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 66 transitions, 563 flow [2022-12-06 06:17:11,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 1042 [2022-12-06 06:17:11,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:11,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 06:17:11,282 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 563 flow [2022-12-06 06:17:11,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:11,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:11,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:17:11,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1033238115, now seen corresponding path program 1 times [2022-12-06 06:17:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:11,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040759814] [2022-12-06 06:17:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040759814] [2022-12-06 06:17:11,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040759814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:11,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:11,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661953108] [2022-12-06 06:17:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:11,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:11,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:11,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:11,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:17:11,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 563 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:11,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:11,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:17:11,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:14,421 INFO L130 PetriNetUnfolder]: 17679/25437 cut-off events. [2022-12-06 06:17:14,422 INFO L131 PetriNetUnfolder]: For 52073/52073 co-relation queries the response was YES. [2022-12-06 06:17:14,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83270 conditions, 25437 events. 17679/25437 cut-off events. For 52073/52073 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 151700 event pairs, 7668 based on Foata normal form. 168/25605 useless extension candidates. Maximal degree in co-relation 83244. Up to 13734 conditions per place. [2022-12-06 06:17:14,616 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 77 selfloop transitions, 17 changer transitions 7/101 dead transitions. [2022-12-06 06:17:14,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 891 flow [2022-12-06 06:17:14,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:17:14,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-06 06:17:14,617 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 563 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:17:14,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 891 flow [2022-12-06 06:17:14,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 891 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:17:14,930 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 549 flow [2022-12-06 06:17:14,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2022-12-06 06:17:14,932 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2022-12-06 06:17:14,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:14,932 INFO L89 Accepts]: Start accepts. Operand has 65 places, 61 transitions, 549 flow [2022-12-06 06:17:14,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:14,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:14,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 61 transitions, 549 flow [2022-12-06 06:17:14,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 61 transitions, 549 flow [2022-12-06 06:17:15,151 INFO L130 PetriNetUnfolder]: 884/2063 cut-off events. [2022-12-06 06:17:15,151 INFO L131 PetriNetUnfolder]: For 2798/2882 co-relation queries the response was YES. [2022-12-06 06:17:15,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 2063 events. 884/2063 cut-off events. For 2798/2882 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 17346 event pairs, 435 based on Foata normal form. 4/1909 useless extension candidates. Maximal degree in co-relation 5031. Up to 1293 conditions per place. [2022-12-06 06:17:15,183 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 61 transitions, 549 flow [2022-12-06 06:17:15,183 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 06:17:15,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:15,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 06:17:15,203 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 549 flow [2022-12-06 06:17:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:15,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:15,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:15,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:17:15,204 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2068955565, now seen corresponding path program 2 times [2022-12-06 06:17:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:15,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349532612] [2022-12-06 06:17:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349532612] [2022-12-06 06:17:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349532612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:15,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:15,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:17:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740299276] [2022-12-06 06:17:15,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:15,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:17:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:15,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:17:15,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:17:15,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:17:15,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:15,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:15,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:17:15,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:16,624 INFO L130 PetriNetUnfolder]: 5702/9216 cut-off events. [2022-12-06 06:17:16,624 INFO L131 PetriNetUnfolder]: For 13113/13228 co-relation queries the response was YES. [2022-12-06 06:17:16,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27850 conditions, 9216 events. 5702/9216 cut-off events. For 13113/13228 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 61057 event pairs, 1298 based on Foata normal form. 812/9766 useless extension candidates. Maximal degree in co-relation 27821. Up to 4263 conditions per place. [2022-12-06 06:17:16,703 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 75 selfloop transitions, 9 changer transitions 4/109 dead transitions. [2022-12-06 06:17:16,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 1036 flow [2022-12-06 06:17:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:17:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:17:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 06:17:16,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2022-12-06 06:17:16,705 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 549 flow. Second operand 4 states and 81 transitions. [2022-12-06 06:17:16,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 1036 flow [2022-12-06 06:17:16,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 945 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:16,720 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 516 flow [2022-12-06 06:17:16,720 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=516, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2022-12-06 06:17:16,720 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2022-12-06 06:17:16,721 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:16,721 INFO L89 Accepts]: Start accepts. Operand has 67 places, 63 transitions, 516 flow [2022-12-06 06:17:16,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:16,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:16,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 63 transitions, 516 flow [2022-12-06 06:17:16,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 63 transitions, 516 flow [2022-12-06 06:17:16,901 INFO L130 PetriNetUnfolder]: 547/1435 cut-off events. [2022-12-06 06:17:16,901 INFO L131 PetriNetUnfolder]: For 1969/2219 co-relation queries the response was YES. [2022-12-06 06:17:16,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4520 conditions, 1435 events. 547/1435 cut-off events. For 1969/2219 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 11428 event pairs, 146 based on Foata normal form. 73/1442 useless extension candidates. Maximal degree in co-relation 4493. Up to 850 conditions per place. [2022-12-06 06:17:16,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 63 transitions, 516 flow [2022-12-06 06:17:16,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 968 [2022-12-06 06:17:16,928 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:16,929 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 06:17:16,929 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 516 flow [2022-12-06 06:17:16,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:16,929 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:16,929 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:16,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:17:16,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2022981083, now seen corresponding path program 1 times [2022-12-06 06:17:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064053838] [2022-12-06 06:17:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:17,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:17,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064053838] [2022-12-06 06:17:17,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064053838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:17,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:17,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:17,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238039146] [2022-12-06 06:17:17,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:17,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:17,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:17,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:17,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:17:17,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 516 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-06 06:17:17,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:17,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:17:17,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:18,072 INFO L130 PetriNetUnfolder]: 4213/6824 cut-off events. [2022-12-06 06:17:18,072 INFO L131 PetriNetUnfolder]: For 10902/10942 co-relation queries the response was YES. [2022-12-06 06:17:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23152 conditions, 6824 events. 4213/6824 cut-off events. For 10902/10942 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 43797 event pairs, 1074 based on Foata normal form. 401/6987 useless extension candidates. Maximal degree in co-relation 23122. Up to 2553 conditions per place. [2022-12-06 06:17:18,101 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 85 selfloop transitions, 13 changer transitions 5/122 dead transitions. [2022-12-06 06:17:18,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 122 transitions, 1052 flow [2022-12-06 06:17:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:17:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:17:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 06:17:18,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.696551724137931 [2022-12-06 06:17:18,103 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 516 flow. Second operand 5 states and 101 transitions. [2022-12-06 06:17:18,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 122 transitions, 1052 flow [2022-12-06 06:17:18,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 122 transitions, 996 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:17:18,119 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 504 flow [2022-12-06 06:17:18,120 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-12-06 06:17:18,121 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2022-12-06 06:17:18,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:18,121 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 504 flow [2022-12-06 06:17:18,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:18,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:18,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 504 flow [2022-12-06 06:17:18,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 64 transitions, 504 flow [2022-12-06 06:17:18,181 INFO L130 PetriNetUnfolder]: 343/906 cut-off events. [2022-12-06 06:17:18,182 INFO L131 PetriNetUnfolder]: For 1569/1765 co-relation queries the response was YES. [2022-12-06 06:17:18,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 906 events. 343/906 cut-off events. For 1569/1765 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6280 event pairs, 64 based on Foata normal form. 69/934 useless extension candidates. Maximal degree in co-relation 3100. Up to 409 conditions per place. [2022-12-06 06:17:18,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 64 transitions, 504 flow [2022-12-06 06:17:18,190 INFO L188 LiptonReduction]: Number of co-enabled transitions 876 [2022-12-06 06:17:18,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:18,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 06:17:18,219 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 504 flow [2022-12-06 06:17:18,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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-06 06:17:18,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:18,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:18,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:17:18,220 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 177442422, now seen corresponding path program 1 times [2022-12-06 06:17:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:18,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826246477] [2022-12-06 06:17:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:18,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:18,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826246477] [2022-12-06 06:17:18,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826246477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:18,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:18,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:17:18,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336849609] [2022-12-06 06:17:18,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:17:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:17:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:17:18,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:17:18,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 504 flow. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:18,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:18,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:17:18,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:19,769 INFO L130 PetriNetUnfolder]: 7396/11283 cut-off events. [2022-12-06 06:17:19,769 INFO L131 PetriNetUnfolder]: For 27276/27276 co-relation queries the response was YES. [2022-12-06 06:17:19,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41349 conditions, 11283 events. 7396/11283 cut-off events. For 27276/27276 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 66025 event pairs, 658 based on Foata normal form. 13/11296 useless extension candidates. Maximal degree in co-relation 41320. Up to 4711 conditions per place. [2022-12-06 06:17:19,823 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 90 selfloop transitions, 24 changer transitions 51/165 dead transitions. [2022-12-06 06:17:19,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 165 transitions, 1525 flow [2022-12-06 06:17:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-12-06 06:17:19,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2022-12-06 06:17:19,825 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 504 flow. Second operand 6 states and 94 transitions. [2022-12-06 06:17:19,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 165 transitions, 1525 flow [2022-12-06 06:17:19,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 165 transitions, 1397 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-06 06:17:19,985 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 540 flow [2022-12-06 06:17:19,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2022-12-06 06:17:19,986 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2022-12-06 06:17:19,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:19,986 INFO L89 Accepts]: Start accepts. Operand has 72 places, 65 transitions, 540 flow [2022-12-06 06:17:19,989 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:19,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:19,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 65 transitions, 540 flow [2022-12-06 06:17:19,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 65 transitions, 540 flow [2022-12-06 06:17:20,104 INFO L130 PetriNetUnfolder]: 419/1138 cut-off events. [2022-12-06 06:17:20,105 INFO L131 PetriNetUnfolder]: For 1826/2042 co-relation queries the response was YES. [2022-12-06 06:17:20,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3453 conditions, 1138 events. 419/1138 cut-off events. For 1826/2042 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8588 event pairs, 70 based on Foata normal form. 82/1160 useless extension candidates. Maximal degree in co-relation 3425. Up to 404 conditions per place. [2022-12-06 06:17:20,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 65 transitions, 540 flow [2022-12-06 06:17:20,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 06:17:20,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:20,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 06:17:20,164 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 540 flow [2022-12-06 06:17:20,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:20,164 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:20,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:20,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:17:20,164 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1984155914, now seen corresponding path program 2 times [2022-12-06 06:17:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:20,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511099231] [2022-12-06 06:17:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:20,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511099231] [2022-12-06 06:17:20,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511099231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:20,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:20,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:17:20,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385904022] [2022-12-06 06:17:20,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:20,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:17:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:17:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:17:20,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:17:20,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:20,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:20,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:17:20,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:21,556 INFO L130 PetriNetUnfolder]: 4582/7451 cut-off events. [2022-12-06 06:17:21,556 INFO L131 PetriNetUnfolder]: For 12376/12520 co-relation queries the response was YES. [2022-12-06 06:17:21,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24013 conditions, 7451 events. 4582/7451 cut-off events. For 12376/12520 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 49816 event pairs, 1159 based on Foata normal form. 127/7384 useless extension candidates. Maximal degree in co-relation 23982. Up to 2942 conditions per place. [2022-12-06 06:17:21,594 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 17 changer transitions 49/123 dead transitions. [2022-12-06 06:17:21,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 123 transitions, 1133 flow [2022-12-06 06:17:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 06:17:21,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2022-12-06 06:17:21,596 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 540 flow. Second operand 6 states and 106 transitions. [2022-12-06 06:17:21,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 123 transitions, 1133 flow [2022-12-06 06:17:21,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 123 transitions, 1106 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 06:17:21,787 INFO L231 Difference]: Finished difference. Result has 76 places, 41 transitions, 262 flow [2022-12-06 06:17:21,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=76, PETRI_TRANSITIONS=41} [2022-12-06 06:17:21,788 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2022-12-06 06:17:21,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:21,789 INFO L89 Accepts]: Start accepts. Operand has 76 places, 41 transitions, 262 flow [2022-12-06 06:17:21,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:21,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:21,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 41 transitions, 262 flow [2022-12-06 06:17:21,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 41 transitions, 262 flow [2022-12-06 06:17:21,799 INFO L130 PetriNetUnfolder]: 39/122 cut-off events. [2022-12-06 06:17:21,800 INFO L131 PetriNetUnfolder]: For 175/211 co-relation queries the response was YES. [2022-12-06 06:17:21,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 122 events. 39/122 cut-off events. For 175/211 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 443 event pairs, 6 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 379. Up to 38 conditions per place. [2022-12-06 06:17:21,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 41 transitions, 262 flow [2022-12-06 06:17:21,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 06:17:22,582 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:17:22,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 794 [2022-12-06 06:17:22,582 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 35 transitions, 248 flow [2022-12-06 06:17:22,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:22,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:22,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:17:22,583 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1384979588, now seen corresponding path program 1 times [2022-12-06 06:17:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:22,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138531126] [2022-12-06 06:17:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:23,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:23,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138531126] [2022-12-06 06:17:23,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138531126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:23,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:23,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:17:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785931668] [2022-12-06 06:17:23,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:23,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:17:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:23,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:17:23,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:17:23,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 06:17:23,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 35 transitions, 248 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:23,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:23,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 06:17:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:24,001 INFO L130 PetriNetUnfolder]: 834/1382 cut-off events. [2022-12-06 06:17:24,001 INFO L131 PetriNetUnfolder]: For 3221/3227 co-relation queries the response was YES. [2022-12-06 06:17:24,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5099 conditions, 1382 events. 834/1382 cut-off events. For 3221/3227 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6575 event pairs, 124 based on Foata normal form. 1/1379 useless extension candidates. Maximal degree in co-relation 5071. Up to 664 conditions per place. [2022-12-06 06:17:24,033 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 46 selfloop transitions, 4 changer transitions 41/92 dead transitions. [2022-12-06 06:17:24,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 92 transitions, 763 flow [2022-12-06 06:17:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:17:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:17:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 06:17:24,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2022-12-06 06:17:24,035 INFO L175 Difference]: Start difference. First operand has 64 places, 35 transitions, 248 flow. Second operand 6 states and 68 transitions. [2022-12-06 06:17:24,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 92 transitions, 763 flow [2022-12-06 06:17:24,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 612 flow, removed 27 selfloop flow, removed 16 redundant places. [2022-12-06 06:17:24,045 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 199 flow [2022-12-06 06:17:24,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2022-12-06 06:17:24,060 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-06 06:17:24,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:24,060 INFO L89 Accepts]: Start accepts. Operand has 56 places, 37 transitions, 199 flow [2022-12-06 06:17:24,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:24,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:24,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 37 transitions, 199 flow [2022-12-06 06:17:24,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 37 transitions, 199 flow [2022-12-06 06:17:24,071 INFO L130 PetriNetUnfolder]: 47/137 cut-off events. [2022-12-06 06:17:24,071 INFO L131 PetriNetUnfolder]: For 188/210 co-relation queries the response was YES. [2022-12-06 06:17:24,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 137 events. 47/137 cut-off events. For 188/210 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 573 event pairs, 4 based on Foata normal form. 8/139 useless extension candidates. Maximal degree in co-relation 380. Up to 42 conditions per place. [2022-12-06 06:17:24,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 199 flow [2022-12-06 06:17:24,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:17:24,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [540] $Ultimate##0-->L768: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_79| 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_79| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|) (= v_~a$w_buff0_used~0_481 1) (= v_~a$r_buff0_thd1~0_187 v_~a$r_buff1_thd1~0_117) (= v_~a$r_buff0_thd2~0_137 v_~a$r_buff1_thd2~0_139) (= |v_P0Thread1of1ForFork1_~arg#1.base_77| |v_P0Thread1of1ForFork1_#in~arg#1.base_77|) (= |v_P0Thread1of1ForFork1_~arg#1.offset_77| |v_P0Thread1of1ForFork1_#in~arg#1.offset_77|) (= v_~a$w_buff0~0_288 1) (= v_~a$r_buff0_thd4~0_183 v_~a$r_buff1_thd4~0_191) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_481 256) 0)) (not (= (mod v_~a$w_buff1_used~0_402 256) 0)))) 1 0)) (= v_~a$r_buff0_thd0~0_123 v_~a$r_buff1_thd0~0_122) (= v_~x~0_102 1) (= v_~a$w_buff0_used~0_482 v_~a$w_buff1_used~0_402) (= v_~a$r_buff0_thd3~0_137 v_~a$r_buff1_thd3~0_140) (= v_~a$w_buff0~0_289 v_~a$w_buff1~0_237) (= v_~a$r_buff0_thd1~0_186 1)) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_77|, ~a$w_buff0~0=v_~a$w_buff0~0_289, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_137, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_137, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_482, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_187, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_77|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_183} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_77|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_191, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_117, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_140, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_139, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_137, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_137, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_481, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_186, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_77|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_183, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_77|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_77|, ~a$w_buff1~0=v_~a$w_buff1~0_237, ~a$w_buff0~0=v_~a$w_buff0~0_288, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_122, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_402, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_79|, ~x~0=v_~x~0_102} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0] and [448] $Ultimate##0-->L785: Formula: (and (= v_~x~0_23 2) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 06:17:24,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:17:24,211 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 06:17:24,211 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 197 flow [2022-12-06 06:17:24,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:24,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:24,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:24,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:17:24,211 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1000788554, now seen corresponding path program 1 times [2022-12-06 06:17:24,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:24,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768271617] [2022-12-06 06:17:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:17:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:17:24,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:17:24,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768271617] [2022-12-06 06:17:24,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768271617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:17:24,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:17:24,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:17:24,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888437849] [2022-12-06 06:17:24,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:17:24,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:17:24,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:17:24,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:17:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:17:24,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 06:17:24,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:24,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:17:24,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 06:17:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:17:25,268 INFO L130 PetriNetUnfolder]: 701/1202 cut-off events. [2022-12-06 06:17:25,268 INFO L131 PetriNetUnfolder]: For 1851/1851 co-relation queries the response was YES. [2022-12-06 06:17:25,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4241 conditions, 1202 events. 701/1202 cut-off events. For 1851/1851 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5895 event pairs, 32 based on Foata normal form. 2/1204 useless extension candidates. Maximal degree in co-relation 4218. Up to 400 conditions per place. [2022-12-06 06:17:25,273 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 85 selfloop transitions, 10 changer transitions 36/132 dead transitions. [2022-12-06 06:17:25,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 132 transitions, 946 flow [2022-12-06 06:17:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:17:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:17:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-12-06 06:17:25,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-06 06:17:25,275 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 197 flow. Second operand 8 states and 84 transitions. [2022-12-06 06:17:25,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 132 transitions, 946 flow [2022-12-06 06:17:25,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 132 transitions, 929 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 06:17:25,284 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 265 flow [2022-12-06 06:17:25,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=265, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2022-12-06 06:17:25,284 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2022-12-06 06:17:25,285 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:17:25,285 INFO L89 Accepts]: Start accepts. Operand has 59 places, 43 transitions, 265 flow [2022-12-06 06:17:25,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:17:25,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:17:25,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 43 transitions, 265 flow [2022-12-06 06:17:25,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 43 transitions, 265 flow [2022-12-06 06:17:25,300 INFO L130 PetriNetUnfolder]: 95/242 cut-off events. [2022-12-06 06:17:25,301 INFO L131 PetriNetUnfolder]: For 545/611 co-relation queries the response was YES. [2022-12-06 06:17:25,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 242 events. 95/242 cut-off events. For 545/611 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1221 event pairs, 3 based on Foata normal form. 23/248 useless extension candidates. Maximal degree in co-relation 725. Up to 85 conditions per place. [2022-12-06 06:17:25,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 43 transitions, 265 flow [2022-12-06 06:17:25,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 06:17:25,340 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:17:25,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:17:25,341 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 265 flow [2022-12-06 06:17:25,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:17:25,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:17:25,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:25,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:17:25,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:17:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:17:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash -538244000, now seen corresponding path program 2 times [2022-12-06 06:17:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:17:25,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459940576] [2022-12-06 06:17:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:17:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:17:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:17:25,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:17:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:17:25,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:17:25,472 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:17:25,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:17:25,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:17:25,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:17:25,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:17:25,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:17:25,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:17:25,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:17:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:17:25,476 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:17:25,479 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:17:25,479 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:17:25,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:17:25 BasicIcfg [2022-12-06 06:17:25,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:17:25,595 INFO L158 Benchmark]: Toolchain (without parser) took 37320.56ms. Allocated memory was 249.6MB in the beginning and 5.5GB in the end (delta: 5.2GB). Free memory was 224.5MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 06:17:25,595 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 249.6MB. Free memory is still 226.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:17:25,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.10ms. Allocated memory is still 249.6MB. Free memory was 224.2MB in the beginning and 195.3MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:17:25,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.81ms. Allocated memory is still 249.6MB. Free memory was 195.3MB in the beginning and 192.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:25,596 INFO L158 Benchmark]: Boogie Preprocessor took 32.80ms. Allocated memory is still 249.6MB. Free memory was 192.8MB in the beginning and 190.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:17:25,596 INFO L158 Benchmark]: RCFGBuilder took 803.39ms. Allocated memory is still 249.6MB. Free memory was 190.7MB in the beginning and 152.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:17:25,596 INFO L158 Benchmark]: TraceAbstraction took 35844.77ms. Allocated memory was 249.6MB in the beginning and 5.5GB in the end (delta: 5.2GB). Free memory was 152.4MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-06 06:17:25,597 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 249.6MB. Free memory is still 226.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.10ms. Allocated memory is still 249.6MB. Free memory was 224.2MB in the beginning and 195.3MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.81ms. Allocated memory is still 249.6MB. Free memory was 195.3MB in the beginning and 192.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.80ms. Allocated memory is still 249.6MB. Free memory was 192.8MB in the beginning and 190.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 803.39ms. Allocated memory is still 249.6MB. Free memory was 190.7MB in the beginning and 152.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 35844.77ms. Allocated memory was 249.6MB in the beginning and 5.5GB in the end (delta: 5.2GB). Free memory was 152.4MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 140 PlacesBefore, 49 PlacesAfterwards, 129 TransitionsBefore, 37 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2507, independent: 2430, independent conditional: 2430, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2507, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2507, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2507, independent: 2430, independent conditional: 0, independent unconditional: 2430, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1950, independent: 1897, independent conditional: 0, independent unconditional: 1897, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1950, independent: 1885, independent conditional: 0, independent unconditional: 1885, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 208, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2507, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1950, unknown conditional: 0, unknown unconditional: 1950] , Statistics on independence cache: Total cache size (in pairs): 2870, Positive cache size: 2817, Positive conditional cache size: 0, Positive unconditional cache size: 2817, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 215, independent: 183, independent conditional: 183, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 215, independent: 183, independent conditional: 22, independent unconditional: 161, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, independent: 183, independent conditional: 22, independent unconditional: 161, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 183, independent conditional: 22, independent unconditional: 161, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 198, independent: 171, independent conditional: 21, independent unconditional: 150, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 198, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 75, dependent conditional: 47, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 198, unknown conditional: 31, unknown unconditional: 167] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 171, Positive conditional cache size: 21, Positive unconditional cache size: 150, Negative cache size: 27, Negative conditional cache size: 10, Negative unconditional cache size: 17, 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, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 160, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 26, independent unconditional: 134, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 193, Positive conditional cache size: 21, Positive unconditional cache size: 172, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 196, Positive conditional cache size: 21, Positive unconditional cache size: 175, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, 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.0s, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 177, independent conditional: 177, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 177, independent conditional: 38, independent unconditional: 139, dependent: 33, dependent conditional: 3, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 170, independent conditional: 0, independent unconditional: 170, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 203, Positive conditional cache size: 21, Positive unconditional cache size: 182, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 150, independent conditional: 40, independent unconditional: 110, dependent: 33, dependent conditional: 3, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 183, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 203, Positive conditional cache size: 21, Positive unconditional cache size: 182, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 185, independent: 154, independent conditional: 52, independent unconditional: 102, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185, independent: 154, independent conditional: 10, independent unconditional: 144, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185, independent: 154, independent conditional: 10, independent unconditional: 144, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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: 185, independent: 154, independent conditional: 10, independent unconditional: 144, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 203, Positive conditional cache size: 21, Positive unconditional cache size: 182, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, 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, 61 PlacesBefore, 61 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1042 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 315, independent conditional: 315, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 354, independent: 315, independent conditional: 122, independent unconditional: 193, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 354, independent: 315, independent conditional: 39, independent unconditional: 276, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 354, independent: 315, independent conditional: 39, independent unconditional: 276, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 354, independent: 305, independent conditional: 39, independent unconditional: 266, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 213, Positive conditional cache size: 21, Positive unconditional cache size: 192, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 83, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 223, independent: 192, independent conditional: 78, independent unconditional: 114, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 192, independent conditional: 15, independent unconditional: 177, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 192, independent conditional: 15, independent unconditional: 177, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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: 223, independent: 192, independent conditional: 15, independent unconditional: 177, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 213, Positive conditional cache size: 21, Positive unconditional cache size: 192, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 180, independent conditional: 75, independent unconditional: 105, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 180, independent conditional: 15, independent unconditional: 165, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 180, independent conditional: 15, independent unconditional: 165, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 213, independent: 180, independent conditional: 15, independent unconditional: 165, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 213, Positive conditional cache size: 21, Positive unconditional cache size: 192, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, 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.0s, 68 PlacesBefore, 68 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 205, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 205, independent: 170, independent conditional: 69, independent unconditional: 101, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 205, independent: 170, independent conditional: 15, independent unconditional: 155, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 205, independent: 170, independent conditional: 15, independent unconditional: 155, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 205, independent: 170, independent conditional: 15, independent unconditional: 155, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 213, Positive conditional cache size: 21, Positive unconditional cache size: 192, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 100, independent conditional: 100, 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: 130, independent: 100, independent conditional: 24, independent unconditional: 76, 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: 130, independent: 100, independent conditional: 0, independent unconditional: 100, 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: 130, independent: 100, independent conditional: 0, independent unconditional: 100, 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: 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: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 130, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 214, Positive conditional cache size: 21, Positive unconditional cache size: 193, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 70 PlacesBefore, 64 PlacesAfterwards, 41 TransitionsBefore, 35 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 209, independent: 173, independent conditional: 173, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 209, independent: 173, independent conditional: 99, independent unconditional: 74, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 209, independent: 173, independent conditional: 89, independent unconditional: 84, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 209, independent: 173, independent conditional: 89, independent unconditional: 84, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 6, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, independent: 160, independent conditional: 83, independent unconditional: 77, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 16, unknown conditional: 6, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 290, Positive conditional cache size: 31, Positive unconditional cache size: 259, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 53 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 299, Positive conditional cache size: 35, Positive unconditional cache size: 264, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, 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, 57 PlacesBefore, 57 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 22, independent conditional: 19, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 14, unknown conditional: 11, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 312, Positive conditional cache size: 46, Positive unconditional cache size: 266, Negative cache size: 42, Negative conditional cache size: 10, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t121, ((void *)0), P0, ((void *)0))=-3, t121={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t122, ((void *)0), P1, ((void *)0))=-2, t121={5:0}, t122={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t123, ((void *)0), P2, ((void *)0))=-1, t121={5:0}, t122={6:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t124, ((void *)0), P3, ((void *)0))=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 [L767] 1 x = 1 [L784] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 [L807] 3 __unbuffered_p2_EAX = y [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1437 IncrementalHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 49 mSDtfsCounter, 1437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=7, InterpolantAutomatonStates: 65, 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.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:17:25,645 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...