/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/mix014_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:36,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:36,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:36,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:36,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:36,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:36,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:36,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:36,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:36,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:36,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:36,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:36,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:36,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:36,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:36,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:36,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:36,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:36,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:36,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:36,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:36,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:36,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:36,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:36,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:36,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:36,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:36,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:36,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:36,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:36,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:36,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:36,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:36,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:36,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:36,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:36,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:36,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:36,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:36,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:36,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:36,751 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:18:36,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:36,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:36,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:36,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:36,812 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:36,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:36,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:36,814 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:36,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:36,814 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:36,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:36,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:36,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:36,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:36,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:36,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:36,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:36,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:36,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:36,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:36,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:36,816 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:36,816 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:18:37,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:37,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:37,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:37,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:37,340 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:37,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:18:39,357 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:18:39,707 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:18:39,726 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:18:39,740 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb95794e/c96065c0da264541a1bb36a8eb0105dd/FLAG66c702b03 [2022-12-06 06:18:39,776 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb95794e/c96065c0da264541a1bb36a8eb0105dd [2022-12-06 06:18:39,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:18:39,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:18:39,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:39,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:18:39,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:18:39,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:39" (1/1) ... [2022-12-06 06:18:39,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703f6865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:39, skipping insertion in model container [2022-12-06 06:18:39,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:39" (1/1) ... [2022-12-06 06:18:39,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:18:39,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:18:40,024 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:18:40,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:40,285 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:18:40,298 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/mix014_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:18:40,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:40,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:40,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:40,398 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:18:40,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40 WrapperNode [2022-12-06 06:18:40,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:40,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:40,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:18:40,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:18:40,406 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:18:40" (1/1) ... [2022-12-06 06:18:40,443 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:18:40" (1/1) ... [2022-12-06 06:18:40,472 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-06 06:18:40,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:40,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:18:40,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:18:40,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:18:40,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,516 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:18:40,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:18:40,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:18:40,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:18:40,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (1/1) ... [2022-12-06 06:18:40,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:40,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:40,559 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:18:40,569 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:18:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:18:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:18:40,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:18:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:18:40,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:18:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:18:40,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:18:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:18:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:18:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:18:40,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:18:40,601 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:18:40,764 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:18:40,766 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:18:41,097 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:18:41,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:18:41,221 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:18:41,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:41 BoogieIcfgContainer [2022-12-06 06:18:41,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:18:41,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:18:41,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:18:41,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:18:41,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:18:39" (1/3) ... [2022-12-06 06:18:41,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d444fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:41, skipping insertion in model container [2022-12-06 06:18:41,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:40" (2/3) ... [2022-12-06 06:18:41,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d444fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:41, skipping insertion in model container [2022-12-06 06:18:41,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:41" (3/3) ... [2022-12-06 06:18:41,231 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:18:41,249 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:18:41,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:18:41,249 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:18:41,338 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:18:41,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:18:41,440 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:18:41,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:41,447 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 77 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:18:41,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-12-06 06:18:41,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-12-06 06:18:41,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:41,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:18:41,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2022-12-06 06:18:41,505 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-06 06:18:41,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:41,507 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 77 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:18:41,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2022-12-06 06:18:41,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-06 06:18:47,669 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 06:18:47,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:18:47,688 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;@60480f98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:18:47,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:18:47,691 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:18:47,691 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:47,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:47,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:18:47,692 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:18:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 560100, now seen corresponding path program 1 times [2022-12-06 06:18:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:47,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016539277] [2022-12-06 06:18:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:48,099 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:18:48,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:48,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016539277] [2022-12-06 06:18:48,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016539277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:48,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:48,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884794445] [2022-12-06 06:18:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:48,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:48,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:48,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 06:18:48,133 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:18:48,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:48,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 06:18:48,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:49,411 INFO L130 PetriNetUnfolder]: 6050/8808 cut-off events. [2022-12-06 06:18:49,411 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 06:18:49,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17207 conditions, 8808 events. 6050/8808 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 54716 event pairs, 1106 based on Foata normal form. 0/8058 useless extension candidates. Maximal degree in co-relation 17195. Up to 6574 conditions per place. [2022-12-06 06:18:49,470 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 06:18:49,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-06 06:18:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 06:18:49,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-06 06:18:49,483 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:18:49,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 243 flow [2022-12-06 06:18:49,487 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:18:49,489 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 70 flow [2022-12-06 06:18:49,491 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:18:49,496 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 06:18:49,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:49,497 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 70 flow [2022-12-06 06:18:49,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:49,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:49,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 70 flow [2022-12-06 06:18:49,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-06 06:18:49,515 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 06:18:49,515 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:49,515 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 4. Compared 52 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:18:49,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-06 06:18:49,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 06:18:49,646 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:49,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 06:18:49,649 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-06 06:18:49,649 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:18:49,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:49,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:49,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:18:49,653 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:18:49,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 652461088, now seen corresponding path program 1 times [2022-12-06 06:18:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:49,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429229207] [2022-12-06 06:18:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:49,947 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:18:49,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:49,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429229207] [2022-12-06 06:18:49,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429229207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:49,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:49,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982873881] [2022-12-06 06:18:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:49,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:49,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:18:49,950 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:18:49,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:49,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:18:49,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:52,560 INFO L130 PetriNetUnfolder]: 17583/23844 cut-off events. [2022-12-06 06:18:52,560 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-12-06 06:18:52,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49052 conditions, 23844 events. 17583/23844 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 126407 event pairs, 6559 based on Foata normal form. 548/24392 useless extension candidates. Maximal degree in co-relation 49042. Up to 16827 conditions per place. [2022-12-06 06:18:52,730 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-06 06:18:52,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-06 06:18:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 06:18:52,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 06:18:52,733 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:18:52,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-06 06:18:52,734 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:18:52,735 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 128 flow [2022-12-06 06:18:52,735 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:18:52,736 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-06 06:18:52,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:52,736 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 128 flow [2022-12-06 06:18:52,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:52,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:52,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 128 flow [2022-12-06 06:18:52,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 128 flow [2022-12-06 06:18:52,782 INFO L130 PetriNetUnfolder]: 218/564 cut-off events. [2022-12-06 06:18:52,782 INFO L131 PetriNetUnfolder]: For 53/71 co-relation queries the response was YES. [2022-12-06 06:18:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 564 events. 218/564 cut-off events. For 53/71 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3619 event pairs, 118 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 1063. Up to 311 conditions per place. [2022-12-06 06:18:52,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 128 flow [2022-12-06 06:18:52,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-06 06:18:52,852 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:52,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 06:18:52,854 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 128 flow [2022-12-06 06:18:52,854 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:18:52,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:52,854 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:52,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:18:52,854 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:18:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1248542076, now seen corresponding path program 1 times [2022-12-06 06:18:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:52,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483479323] [2022-12-06 06:18:52,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:53,062 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:18:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:53,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483479323] [2022-12-06 06:18:53,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483479323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:53,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:53,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644309262] [2022-12-06 06:18:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:53,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:53,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:18:53,064 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:18:53,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:53,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:18:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:54,944 INFO L130 PetriNetUnfolder]: 16247/22060 cut-off events. [2022-12-06 06:18:54,944 INFO L131 PetriNetUnfolder]: For 8596/8596 co-relation queries the response was YES. [2022-12-06 06:18:54,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54632 conditions, 22060 events. 16247/22060 cut-off events. For 8596/8596 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 111000 event pairs, 4719 based on Foata normal form. 280/22340 useless extension candidates. Maximal degree in co-relation 54620. Up to 11031 conditions per place. [2022-12-06 06:18:55,103 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 57 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-06 06:18:55,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 348 flow [2022-12-06 06:18:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 06:18:55,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5258620689655172 [2022-12-06 06:18:55,105 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:18:55,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 348 flow [2022-12-06 06:18:55,174 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:18:55,176 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2022-12-06 06:18:55,176 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:18:55,177 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-06 06:18:55,177 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:55,178 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 180 flow [2022-12-06 06:18:55,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:55,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:55,180 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 180 flow [2022-12-06 06:18:55,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 180 flow [2022-12-06 06:18:55,326 INFO L130 PetriNetUnfolder]: 173/448 cut-off events. [2022-12-06 06:18:55,326 INFO L131 PetriNetUnfolder]: For 196/241 co-relation queries the response was YES. [2022-12-06 06:18:55,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 448 events. 173/448 cut-off events. For 196/241 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2622 event pairs, 76 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 1016. Up to 252 conditions per place. [2022-12-06 06:18:55,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 180 flow [2022-12-06 06:18:55,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-06 06:18:55,376 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:55,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 06:18:55,377 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2022-12-06 06:18:55,377 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:18:55,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:55,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:55,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:18:55,378 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:18:55,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash -43184458, now seen corresponding path program 1 times [2022-12-06 06:18:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:55,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897236236] [2022-12-06 06:18:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:55,564 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:18:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:55,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897236236] [2022-12-06 06:18:55,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897236236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:55,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:55,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817793339] [2022-12-06 06:18:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:55,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:55,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:55,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:18:55,569 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:18:55,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:55,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:18:55,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:57,197 INFO L130 PetriNetUnfolder]: 15311/20804 cut-off events. [2022-12-06 06:18:57,198 INFO L131 PetriNetUnfolder]: For 14456/14456 co-relation queries the response was YES. [2022-12-06 06:18:57,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54361 conditions, 20804 events. 15311/20804 cut-off events. For 14456/14456 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 108936 event pairs, 3197 based on Foata normal form. 200/21004 useless extension candidates. Maximal degree in co-relation 54346. Up to 10745 conditions per place. [2022-12-06 06:18:57,310 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 69 selfloop transitions, 12 changer transitions 0/81 dead transitions. [2022-12-06 06:18:57,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 472 flow [2022-12-06 06:18:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 06:18:57,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5948275862068966 [2022-12-06 06:18:57,316 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 4 states and 69 transitions. [2022-12-06 06:18:57,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 472 flow [2022-12-06 06:18:57,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:18:57,348 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 282 flow [2022-12-06 06:18:57,349 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-12-06 06:18:57,350 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-06 06:18:57,350 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:57,350 INFO L89 Accepts]: Start accepts. Operand has 51 places, 47 transitions, 282 flow [2022-12-06 06:18:57,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:57,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:57,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 47 transitions, 282 flow [2022-12-06 06:18:57,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 282 flow [2022-12-06 06:18:57,389 INFO L130 PetriNetUnfolder]: 125/360 cut-off events. [2022-12-06 06:18:57,389 INFO L131 PetriNetUnfolder]: For 378/462 co-relation queries the response was YES. [2022-12-06 06:18:57,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 360 events. 125/360 cut-off events. For 378/462 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2064 event pairs, 56 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 975. Up to 188 conditions per place. [2022-12-06 06:18:57,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 282 flow [2022-12-06 06:18:57,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-06 06:18:57,411 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:57,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 06:18:57,417 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 282 flow [2022-12-06 06:18:57,418 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:18:57,418 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:57,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:18:57,418 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:18:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1383147395, now seen corresponding path program 1 times [2022-12-06 06:18:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:57,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845339701] [2022-12-06 06:18:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:57,583 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:18:57,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:57,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845339701] [2022-12-06 06:18:57,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845339701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:57,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:57,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797207011] [2022-12-06 06:18:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:57,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:57,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:18:57,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:18:57,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:57,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:18:57,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:58,710 INFO L130 PetriNetUnfolder]: 6811/10198 cut-off events. [2022-12-06 06:18:58,710 INFO L131 PetriNetUnfolder]: For 6916/7400 co-relation queries the response was YES. [2022-12-06 06:18:58,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25116 conditions, 10198 events. 6811/10198 cut-off events. For 6916/7400 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 61829 event pairs, 1681 based on Foata normal form. 420/10270 useless extension candidates. Maximal degree in co-relation 25097. Up to 8290 conditions per place. [2022-12-06 06:18:58,782 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2022-12-06 06:18:58,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 468 flow [2022-12-06 06:18:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 06:18:58,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-06 06:18:58,784 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 282 flow. Second operand 3 states and 59 transitions. [2022-12-06 06:18:58,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 468 flow [2022-12-06 06:18:58,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:18:58,793 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 311 flow [2022-12-06 06:18:58,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=311, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2022-12-06 06:18:58,794 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-06 06:18:58,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:58,794 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 311 flow [2022-12-06 06:18:58,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:58,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:58,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 311 flow [2022-12-06 06:18:58,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions, 311 flow [2022-12-06 06:18:58,960 INFO L130 PetriNetUnfolder]: 472/1116 cut-off events. [2022-12-06 06:18:58,961 INFO L131 PetriNetUnfolder]: For 535/659 co-relation queries the response was YES. [2022-12-06 06:18:58,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 1116 events. 472/1116 cut-off events. For 535/659 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8310 event pairs, 230 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 2583. Up to 619 conditions per place. [2022-12-06 06:18:58,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 51 transitions, 311 flow [2022-12-06 06:18:58,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 872 [2022-12-06 06:18:58,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:58,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 06:18:58,981 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 311 flow [2022-12-06 06:18:58,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:18:58,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:58,981 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:18:58,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:18:58,982 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:18:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 162210601, now seen corresponding path program 1 times [2022-12-06 06:18:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:58,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638696892] [2022-12-06 06:18:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:59,158 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:18:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638696892] [2022-12-06 06:18:59,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638696892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:59,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:59,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337575529] [2022-12-06 06:18:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:59,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:59,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:59,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:18:59,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 311 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:18:59,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:59,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:18:59,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:59,731 INFO L130 PetriNetUnfolder]: 3752/5939 cut-off events. [2022-12-06 06:18:59,731 INFO L131 PetriNetUnfolder]: For 4184/4454 co-relation queries the response was YES. [2022-12-06 06:18:59,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17172 conditions, 5939 events. 3752/5939 cut-off events. For 4184/4454 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 35802 event pairs, 957 based on Foata normal form. 499/6214 useless extension candidates. Maximal degree in co-relation 17151. Up to 2346 conditions per place. [2022-12-06 06:18:59,770 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 63 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2022-12-06 06:18:59,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 617 flow [2022-12-06 06:18:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 06:18:59,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2022-12-06 06:18:59,772 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 311 flow. Second operand 4 states and 81 transitions. [2022-12-06 06:18:59,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 617 flow [2022-12-06 06:18:59,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:18:59,780 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 358 flow [2022-12-06 06:18:59,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2022-12-06 06:18:59,781 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-06 06:18:59,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:59,781 INFO L89 Accepts]: Start accepts. Operand has 56 places, 55 transitions, 358 flow [2022-12-06 06:18:59,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:59,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:59,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 55 transitions, 358 flow [2022-12-06 06:18:59,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 358 flow [2022-12-06 06:18:59,842 INFO L130 PetriNetUnfolder]: 286/762 cut-off events. [2022-12-06 06:18:59,842 INFO L131 PetriNetUnfolder]: For 611/810 co-relation queries the response was YES. [2022-12-06 06:18:59,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 762 events. 286/762 cut-off events. For 611/810 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5199 event pairs, 80 based on Foata normal form. 40/758 useless extension candidates. Maximal degree in co-relation 2272. Up to 403 conditions per place. [2022-12-06 06:18:59,852 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 55 transitions, 358 flow [2022-12-06 06:18:59,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 996 [2022-12-06 06:18:59,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:59,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 06:18:59,858 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 358 flow [2022-12-06 06:18:59,859 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:18:59,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:59,859 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:18:59,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:18:59,859 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:18:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 959669904, now seen corresponding path program 1 times [2022-12-06 06:18:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:59,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682501365] [2022-12-06 06:18:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:00,078 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:19:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:00,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682501365] [2022-12-06 06:19:00,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682501365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:00,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:00,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77417457] [2022-12-06 06:19:00,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:00,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:00,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:00,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 06:19:00,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 358 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:19:00,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:00,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 06:19:00,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:01,224 INFO L130 PetriNetUnfolder]: 7656/11384 cut-off events. [2022-12-06 06:19:01,225 INFO L131 PetriNetUnfolder]: For 23009/23009 co-relation queries the response was YES. [2022-12-06 06:19:01,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39755 conditions, 11384 events. 7656/11384 cut-off events. For 23009/23009 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 64056 event pairs, 661 based on Foata normal form. 66/11450 useless extension candidates. Maximal degree in co-relation 39732. Up to 4436 conditions per place. [2022-12-06 06:19:01,282 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 113 selfloop transitions, 35 changer transitions 20/168 dead transitions. [2022-12-06 06:19:01,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 168 transitions, 1340 flow [2022-12-06 06:19:01,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 06:19:01,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2022-12-06 06:19:01,284 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 358 flow. Second operand 6 states and 109 transitions. [2022-12-06 06:19:01,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 168 transitions, 1340 flow [2022-12-06 06:19:01,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 168 transitions, 1266 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 06:19:01,319 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 582 flow [2022-12-06 06:19:01,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-06 06:19:01,320 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-06 06:19:01,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:01,320 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 582 flow [2022-12-06 06:19:01,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:01,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:01,322 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 582 flow [2022-12-06 06:19:01,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 582 flow [2022-12-06 06:19:01,458 INFO L130 PetriNetUnfolder]: 453/1222 cut-off events. [2022-12-06 06:19:01,458 INFO L131 PetriNetUnfolder]: For 1252/1531 co-relation queries the response was YES. [2022-12-06 06:19:01,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3474 conditions, 1222 events. 453/1222 cut-off events. For 1252/1531 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9546 event pairs, 112 based on Foata normal form. 67/1224 useless extension candidates. Maximal degree in co-relation 3452. Up to 591 conditions per place. [2022-12-06 06:19:01,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 582 flow [2022-12-06 06:19:01,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 1190 [2022-12-06 06:19:01,524 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:01,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 06:19:01,525 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 582 flow [2022-12-06 06:19:01,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:19:01,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:01,525 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] [2022-12-06 06:19:01,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:19:01,525 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:19:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 448619556, now seen corresponding path program 1 times [2022-12-06 06:19:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:01,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286532024] [2022-12-06 06:19:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:01,763 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:19:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:01,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286532024] [2022-12-06 06:19:01,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286532024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:01,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:01,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259624672] [2022-12-06 06:19:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:01,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:01,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:19:01,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:01,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:01,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:19:01,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:02,406 INFO L130 PetriNetUnfolder]: 3932/6242 cut-off events. [2022-12-06 06:19:02,407 INFO L131 PetriNetUnfolder]: For 8765/8926 co-relation queries the response was YES. [2022-12-06 06:19:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19036 conditions, 6242 events. 3932/6242 cut-off events. For 8765/8926 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 38755 event pairs, 1045 based on Foata normal form. 311/6289 useless extension candidates. Maximal degree in co-relation 19011. Up to 2391 conditions per place. [2022-12-06 06:19:02,444 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 90 selfloop transitions, 13 changer transitions 1/133 dead transitions. [2022-12-06 06:19:02,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 133 transitions, 1125 flow [2022-12-06 06:19:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 06:19:02,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.696551724137931 [2022-12-06 06:19:02,445 INFO L175 Difference]: Start difference. First operand has 61 places, 71 transitions, 582 flow. Second operand 5 states and 101 transitions. [2022-12-06 06:19:02,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 133 transitions, 1125 flow [2022-12-06 06:19:02,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 133 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:19:02,461 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 636 flow [2022-12-06 06:19:02,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=636, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2022-12-06 06:19:02,462 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-06 06:19:02,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:02,462 INFO L89 Accepts]: Start accepts. Operand has 66 places, 74 transitions, 636 flow [2022-12-06 06:19:02,464 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:02,464 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:02,464 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 74 transitions, 636 flow [2022-12-06 06:19:02,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 74 transitions, 636 flow [2022-12-06 06:19:02,521 INFO L130 PetriNetUnfolder]: 305/765 cut-off events. [2022-12-06 06:19:02,521 INFO L131 PetriNetUnfolder]: For 1841/2155 co-relation queries the response was YES. [2022-12-06 06:19:02,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2716 conditions, 765 events. 305/765 cut-off events. For 1841/2155 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4989 event pairs, 50 based on Foata normal form. 57/780 useless extension candidates. Maximal degree in co-relation 2691. Up to 297 conditions per place. [2022-12-06 06:19:02,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 74 transitions, 636 flow [2022-12-06 06:19:02,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-06 06:19:02,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:02,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 06:19:02,535 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 636 flow [2022-12-06 06:19:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:02,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:02,535 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:19:02,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:19:02,536 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:19:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 580976706, now seen corresponding path program 1 times [2022-12-06 06:19:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164567818] [2022-12-06 06:19:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:03,425 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:19:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164567818] [2022-12-06 06:19:03,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164567818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:03,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:03,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:19:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863402743] [2022-12-06 06:19:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:03,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:19:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:19:03,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:19:03,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:19:03,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 636 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:03,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:03,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:19:03,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:04,564 INFO L130 PetriNetUnfolder]: 5229/8512 cut-off events. [2022-12-06 06:19:04,564 INFO L131 PetriNetUnfolder]: For 18017/18218 co-relation queries the response was YES. [2022-12-06 06:19:04,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29863 conditions, 8512 events. 5229/8512 cut-off events. For 18017/18218 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 57100 event pairs, 851 based on Foata normal form. 37/8314 useless extension candidates. Maximal degree in co-relation 29835. Up to 2903 conditions per place. [2022-12-06 06:19:04,602 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 105 selfloop transitions, 7 changer transitions 51/192 dead transitions. [2022-12-06 06:19:04,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 192 transitions, 1734 flow [2022-12-06 06:19:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:19:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:19:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 06:19:04,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5960591133004927 [2022-12-06 06:19:04,603 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 636 flow. Second operand 7 states and 121 transitions. [2022-12-06 06:19:04,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 192 transitions, 1734 flow [2022-12-06 06:19:04,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 192 transitions, 1580 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:04,748 INFO L231 Difference]: Finished difference. Result has 72 places, 79 transitions, 651 flow [2022-12-06 06:19:04,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=651, PETRI_PLACES=72, PETRI_TRANSITIONS=79} [2022-12-06 06:19:04,749 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2022-12-06 06:19:04,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:04,749 INFO L89 Accepts]: Start accepts. Operand has 72 places, 79 transitions, 651 flow [2022-12-06 06:19:04,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:04,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:04,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 79 transitions, 651 flow [2022-12-06 06:19:04,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 79 transitions, 651 flow [2022-12-06 06:19:04,832 INFO L130 PetriNetUnfolder]: 536/1323 cut-off events. [2022-12-06 06:19:04,833 INFO L131 PetriNetUnfolder]: For 2405/2716 co-relation queries the response was YES. [2022-12-06 06:19:04,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4301 conditions, 1323 events. 536/1323 cut-off events. For 2405/2716 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9821 event pairs, 59 based on Foata normal form. 95/1341 useless extension candidates. Maximal degree in co-relation 4273. Up to 430 conditions per place. [2022-12-06 06:19:04,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 79 transitions, 651 flow [2022-12-06 06:19:04,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 1234 [2022-12-06 06:19:04,997 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:04,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-06 06:19:04,998 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 79 transitions, 657 flow [2022-12-06 06:19:04,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:04,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:04,998 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:19:04,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:19:04,999 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:19:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash 453800780, now seen corresponding path program 2 times [2022-12-06 06:19:04,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:04,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675989197] [2022-12-06 06:19:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:04,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:05,214 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:19:05,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:05,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675989197] [2022-12-06 06:19:05,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675989197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:05,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:05,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:19:05,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138275902] [2022-12-06 06:19:05,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:05,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:05,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:05,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2022-12-06 06:19:05,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 79 transitions, 657 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:19:05,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:05,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2022-12-06 06:19:05,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:05,995 INFO L130 PetriNetUnfolder]: 4446/7132 cut-off events. [2022-12-06 06:19:05,995 INFO L131 PetriNetUnfolder]: For 13488/13734 co-relation queries the response was YES. [2022-12-06 06:19:06,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25106 conditions, 7132 events. 4446/7132 cut-off events. For 13488/13734 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 46881 event pairs, 988 based on Foata normal form. 112/6973 useless extension candidates. Maximal degree in co-relation 25080. Up to 2841 conditions per place. [2022-12-06 06:19:06,037 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 82 selfloop transitions, 17 changer transitions 22/141 dead transitions. [2022-12-06 06:19:06,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 141 transitions, 1235 flow [2022-12-06 06:19:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 06:19:06,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2022-12-06 06:19:06,040 INFO L175 Difference]: Start difference. First operand has 70 places, 79 transitions, 657 flow. Second operand 6 states and 107 transitions. [2022-12-06 06:19:06,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 141 transitions, 1235 flow [2022-12-06 06:19:06,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 141 transitions, 1216 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-06 06:19:06,242 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 530 flow [2022-12-06 06:19:06,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=530, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2022-12-06 06:19:06,244 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2022-12-06 06:19:06,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:06,244 INFO L89 Accepts]: Start accepts. Operand has 72 places, 66 transitions, 530 flow [2022-12-06 06:19:06,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:06,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:06,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 66 transitions, 530 flow [2022-12-06 06:19:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 66 transitions, 530 flow [2022-12-06 06:19:06,301 INFO L130 PetriNetUnfolder]: 269/709 cut-off events. [2022-12-06 06:19:06,302 INFO L131 PetriNetUnfolder]: For 1534/1718 co-relation queries the response was YES. [2022-12-06 06:19:06,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2610 conditions, 709 events. 269/709 cut-off events. For 1534/1718 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4840 event pairs, 32 based on Foata normal form. 2/666 useless extension candidates. Maximal degree in co-relation 2591. Up to 215 conditions per place. [2022-12-06 06:19:06,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 66 transitions, 530 flow [2022-12-06 06:19:06,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 842 [2022-12-06 06:19:07,038 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:19:07,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 795 [2022-12-06 06:19:07,039 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 538 flow [2022-12-06 06:19:07,039 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:19:07,040 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:07,040 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, 1, 1] [2022-12-06 06:19:07,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:19:07,040 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:19:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash -58577441, now seen corresponding path program 1 times [2022-12-06 06:19:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:07,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052001801] [2022-12-06 06:19:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:07,253 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:19:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052001801] [2022-12-06 06:19:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052001801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:07,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:07,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204046315] [2022-12-06 06:19:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:07,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:07,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:07,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:19:07,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 538 flow. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:19:07,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:07,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:19:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:08,069 INFO L130 PetriNetUnfolder]: 4870/7516 cut-off events. [2022-12-06 06:19:08,069 INFO L131 PetriNetUnfolder]: For 23374/23374 co-relation queries the response was YES. [2022-12-06 06:19:08,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30474 conditions, 7516 events. 4870/7516 cut-off events. For 23374/23374 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 42761 event pairs, 660 based on Foata normal form. 1/7517 useless extension candidates. Maximal degree in co-relation 30444. Up to 2836 conditions per place. [2022-12-06 06:19:08,102 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 102 selfloop transitions, 29 changer transitions 12/143 dead transitions. [2022-12-06 06:19:08,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 143 transitions, 1360 flow [2022-12-06 06:19:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-06 06:19:08,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-06 06:19:08,105 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 538 flow. Second operand 5 states and 76 transitions. [2022-12-06 06:19:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 143 transitions, 1360 flow [2022-12-06 06:19:08,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 1228 flow, removed 26 selfloop flow, removed 5 redundant places. [2022-12-06 06:19:08,211 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 703 flow [2022-12-06 06:19:08,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=703, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2022-12-06 06:19:08,212 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2022-12-06 06:19:08,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:08,212 INFO L89 Accepts]: Start accepts. Operand has 71 places, 75 transitions, 703 flow [2022-12-06 06:19:08,213 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:08,213 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:08,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 75 transitions, 703 flow [2022-12-06 06:19:08,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 75 transitions, 703 flow [2022-12-06 06:19:08,277 INFO L130 PetriNetUnfolder]: 371/978 cut-off events. [2022-12-06 06:19:08,278 INFO L131 PetriNetUnfolder]: For 3176/3355 co-relation queries the response was YES. [2022-12-06 06:19:08,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3430 conditions, 978 events. 371/978 cut-off events. For 3176/3355 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7561 event pairs, 18 based on Foata normal form. 60/964 useless extension candidates. Maximal degree in co-relation 3401. Up to 277 conditions per place. [2022-12-06 06:19:08,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 75 transitions, 703 flow [2022-12-06 06:19:08,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 06:19:08,290 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:08,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-06 06:19:08,290 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 703 flow [2022-12-06 06:19:08,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:19:08,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:08,291 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, 1, 1] [2022-12-06 06:19:08,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:19:08,291 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:19:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1102680244, now seen corresponding path program 1 times [2022-12-06 06:19:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:08,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106530341] [2022-12-06 06:19:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:08,512 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:19:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106530341] [2022-12-06 06:19:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106530341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:08,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608439934] [2022-12-06 06:19:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:08,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:19:08,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 703 flow. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:19:08,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:08,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:19:08,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:09,372 INFO L130 PetriNetUnfolder]: 6059/9476 cut-off events. [2022-12-06 06:19:09,372 INFO L131 PetriNetUnfolder]: For 30232/30232 co-relation queries the response was YES. [2022-12-06 06:19:09,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38345 conditions, 9476 events. 6059/9476 cut-off events. For 30232/30232 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 57484 event pairs, 2045 based on Foata normal form. 2/9478 useless extension candidates. Maximal degree in co-relation 38313. Up to 5003 conditions per place. [2022-12-06 06:19:09,412 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 57 selfloop transitions, 8 changer transitions 58/123 dead transitions. [2022-12-06 06:19:09,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 1208 flow [2022-12-06 06:19:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 06:19:09,413 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-06 06:19:09,413 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 703 flow. Second operand 4 states and 61 transitions. [2022-12-06 06:19:09,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 1208 flow [2022-12-06 06:19:09,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 123 transitions, 1198 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 06:19:09,618 INFO L231 Difference]: Finished difference. Result has 76 places, 51 transitions, 369 flow [2022-12-06 06:19:09,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=369, PETRI_PLACES=76, PETRI_TRANSITIONS=51} [2022-12-06 06:19:09,618 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 27 predicate places. [2022-12-06 06:19:09,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:09,619 INFO L89 Accepts]: Start accepts. Operand has 76 places, 51 transitions, 369 flow [2022-12-06 06:19:09,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:09,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:09,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 51 transitions, 369 flow [2022-12-06 06:19:09,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 51 transitions, 369 flow [2022-12-06 06:19:09,646 INFO L130 PetriNetUnfolder]: 142/391 cut-off events. [2022-12-06 06:19:09,647 INFO L131 PetriNetUnfolder]: For 850/921 co-relation queries the response was YES. [2022-12-06 06:19:09,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 391 events. 142/391 cut-off events. For 850/921 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2402 event pairs, 11 based on Foata normal form. 13/376 useless extension candidates. Maximal degree in co-relation 1224. Up to 120 conditions per place. [2022-12-06 06:19:09,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 51 transitions, 369 flow [2022-12-06 06:19:09,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-06 06:19:09,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L765-->L768: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [526] $Ultimate##0-->L785: Formula: (and (= v_~x~0_57 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_57} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 06:19:09,842 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:09,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 06:19:09,844 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 360 flow [2022-12-06 06:19:09,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:19:09,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:09,844 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, 1] [2022-12-06 06:19:09,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:19:09,844 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:19:09,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1913641146, now seen corresponding path program 1 times [2022-12-06 06:19:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:09,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060144282] [2022-12-06 06:19:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:10,896 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:19:10,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:10,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060144282] [2022-12-06 06:19:10,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060144282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:10,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:10,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:19:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11474749] [2022-12-06 06:19:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:10,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:19:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:10,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:19:10,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:19:10,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:19:10,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:10,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:10,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:19:10,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:11,361 INFO L130 PetriNetUnfolder]: 1572/2643 cut-off events. [2022-12-06 06:19:11,361 INFO L131 PetriNetUnfolder]: For 6655/6841 co-relation queries the response was YES. [2022-12-06 06:19:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10243 conditions, 2643 events. 1572/2643 cut-off events. For 6655/6841 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 15209 event pairs, 237 based on Foata normal form. 44/2658 useless extension candidates. Maximal degree in co-relation 10207. Up to 1283 conditions per place. [2022-12-06 06:19:11,371 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 92 selfloop transitions, 5 changer transitions 28/132 dead transitions. [2022-12-06 06:19:11,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 132 transitions, 1092 flow [2022-12-06 06:19:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 06:19:11,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2022-12-06 06:19:11,373 INFO L175 Difference]: Start difference. First operand has 72 places, 49 transitions, 360 flow. Second operand 6 states and 103 transitions. [2022-12-06 06:19:11,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 132 transitions, 1092 flow [2022-12-06 06:19:11,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 132 transitions, 1044 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-06 06:19:11,409 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 365 flow [2022-12-06 06:19:11,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2022-12-06 06:19:11,409 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 24 predicate places. [2022-12-06 06:19:11,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:11,410 INFO L89 Accepts]: Start accepts. Operand has 73 places, 52 transitions, 365 flow [2022-12-06 06:19:11,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:11,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:11,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 52 transitions, 365 flow [2022-12-06 06:19:11,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 52 transitions, 365 flow [2022-12-06 06:19:11,443 INFO L130 PetriNetUnfolder]: 196/501 cut-off events. [2022-12-06 06:19:11,443 INFO L131 PetriNetUnfolder]: For 1283/1350 co-relation queries the response was YES. [2022-12-06 06:19:11,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 501 events. 196/501 cut-off events. For 1283/1350 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3214 event pairs, 4 based on Foata normal form. 18/486 useless extension candidates. Maximal degree in co-relation 1617. Up to 161 conditions per place. [2022-12-06 06:19:11,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 52 transitions, 365 flow [2022-12-06 06:19:11,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-06 06:19:11,456 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:11,456 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 06:19:11,456 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 365 flow [2022-12-06 06:19:11,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:11,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:11,457 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] [2022-12-06 06:19:11,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:19:11,457 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:19:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1220628885, now seen corresponding path program 1 times [2022-12-06 06:19:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:11,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918652502] [2022-12-06 06:19:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:11,662 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:19:11,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:11,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918652502] [2022-12-06 06:19:11,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918652502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:11,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:11,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243787998] [2022-12-06 06:19:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:11,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:19:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:11,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:19:11,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:19:11,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 06:19:11,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 365 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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:19:11,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:11,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 06:19:11,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:12,110 INFO L130 PetriNetUnfolder]: 2072/3385 cut-off events. [2022-12-06 06:19:12,111 INFO L131 PetriNetUnfolder]: For 8718/8718 co-relation queries the response was YES. [2022-12-06 06:19:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13913 conditions, 3385 events. 2072/3385 cut-off events. For 8718/8718 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18666 event pairs, 418 based on Foata normal form. 2/3387 useless extension candidates. Maximal degree in co-relation 13879. Up to 1555 conditions per place. [2022-12-06 06:19:12,121 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 58 selfloop transitions, 3 changer transitions 50/111 dead transitions. [2022-12-06 06:19:12,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 111 transitions, 944 flow [2022-12-06 06:19:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:19:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:19:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 06:19:12,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 06:19:12,123 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 365 flow. Second operand 6 states and 65 transitions. [2022-12-06 06:19:12,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 111 transitions, 944 flow [2022-12-06 06:19:12,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 111 transitions, 933 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 06:19:12,157 INFO L231 Difference]: Finished difference. Result has 75 places, 43 transitions, 268 flow [2022-12-06 06:19:12,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=75, PETRI_TRANSITIONS=43} [2022-12-06 06:19:12,158 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2022-12-06 06:19:12,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:12,158 INFO L89 Accepts]: Start accepts. Operand has 75 places, 43 transitions, 268 flow [2022-12-06 06:19:12,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:12,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:12,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 43 transitions, 268 flow [2022-12-06 06:19:12,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 43 transitions, 268 flow [2022-12-06 06:19:12,176 INFO L130 PetriNetUnfolder]: 97/252 cut-off events. [2022-12-06 06:19:12,176 INFO L131 PetriNetUnfolder]: For 894/971 co-relation queries the response was YES. [2022-12-06 06:19:12,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 252 events. 97/252 cut-off events. For 894/971 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1217 event pairs, 7 based on Foata normal form. 14/244 useless extension candidates. Maximal degree in co-relation 777. Up to 83 conditions per place. [2022-12-06 06:19:12,177 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 43 transitions, 268 flow [2022-12-06 06:19:12,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 06:19:12,303 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:19:12,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-06 06:19:12,304 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 264 flow [2022-12-06 06:19:12,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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:19:12,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:12,304 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] [2022-12-06 06:19:12,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:19:12,304 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:19:12,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash 221248614, now seen corresponding path program 1 times [2022-12-06 06:19:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:12,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295416772] [2022-12-06 06:19:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:13,129 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:19:13,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:13,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295416772] [2022-12-06 06:19:13,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295416772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:13,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:13,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:19:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126811282] [2022-12-06 06:19:13,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:13,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:19:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:19:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:19:13,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:19:13,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 264 flow. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:13,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:19:13,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:13,491 INFO L130 PetriNetUnfolder]: 858/1463 cut-off events. [2022-12-06 06:19:13,491 INFO L131 PetriNetUnfolder]: For 4023/4040 co-relation queries the response was YES. [2022-12-06 06:19:13,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5989 conditions, 1463 events. 858/1463 cut-off events. For 4023/4040 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7324 event pairs, 54 based on Foata normal form. 11/1461 useless extension candidates. Maximal degree in co-relation 5955. Up to 750 conditions per place. [2022-12-06 06:19:13,497 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 78 selfloop transitions, 9 changer transitions 33/122 dead transitions. [2022-12-06 06:19:13,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 122 transitions, 951 flow [2022-12-06 06:19:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:19:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:19:13,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-12-06 06:19:13,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2022-12-06 06:19:13,498 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 264 flow. Second operand 7 states and 89 transitions. [2022-12-06 06:19:13,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 122 transitions, 951 flow [2022-12-06 06:19:13,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 892 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-06 06:19:13,512 INFO L231 Difference]: Finished difference. Result has 67 places, 42 transitions, 277 flow [2022-12-06 06:19:13,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2022-12-06 06:19:13,513 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2022-12-06 06:19:13,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:13,513 INFO L89 Accepts]: Start accepts. Operand has 67 places, 42 transitions, 277 flow [2022-12-06 06:19:13,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:13,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:13,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 42 transitions, 277 flow [2022-12-06 06:19:13,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 42 transitions, 277 flow [2022-12-06 06:19:13,531 INFO L130 PetriNetUnfolder]: 89/238 cut-off events. [2022-12-06 06:19:13,531 INFO L131 PetriNetUnfolder]: For 919/1004 co-relation queries the response was YES. [2022-12-06 06:19:13,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 238 events. 89/238 cut-off events. For 919/1004 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1204 event pairs, 7 based on Foata normal form. 21/243 useless extension candidates. Maximal degree in co-relation 757. Up to 81 conditions per place. [2022-12-06 06:19:13,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 42 transitions, 277 flow [2022-12-06 06:19:13,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 06:19:13,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:19:13,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 432 [2022-12-06 06:19:13,945 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 275 flow [2022-12-06 06:19:13,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:13,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:13,945 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:19:13,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:19:13,945 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:19:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash 540065964, now seen corresponding path program 1 times [2022-12-06 06:19:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:13,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699970902] [2022-12-06 06:19:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:13,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:19:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:14,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:19:14,054 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:19:14,054 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:19:14,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:19:14,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:19:14,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:19:14,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:19:14,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:19:14,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:19:14,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:19:14,057 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:14,062 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:19:14,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:19:14,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:19:14 BasicIcfg [2022-12-06 06:19:14,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:19:14,141 INFO L158 Benchmark]: Toolchain (without parser) took 34361.80ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 135.5MB in the beginning and 765.3MB in the end (delta: -629.8MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 06:19:14,142 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:19:14,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.06ms. Allocated memory is still 178.3MB. Free memory was 135.3MB in the beginning and 107.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.03ms. Allocated memory is still 178.3MB. Free memory was 107.0MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,142 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 178.3MB. Free memory was 104.4MB in the beginning and 101.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,142 INFO L158 Benchmark]: RCFGBuilder took 703.08ms. Allocated memory is still 178.3MB. Free memory was 101.8MB in the beginning and 64.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:19:14,143 INFO L158 Benchmark]: TraceAbstraction took 32914.63ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 63.0MB in the beginning and 765.3MB in the end (delta: -702.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 06:19:14,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 153.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 609.06ms. Allocated memory is still 178.3MB. Free memory was 135.3MB in the beginning and 107.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.03ms. Allocated memory is still 178.3MB. Free memory was 107.0MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 178.3MB. Free memory was 104.4MB in the beginning and 101.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 703.08ms. Allocated memory is still 178.3MB. Free memory was 101.8MB in the beginning and 64.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 32914.63ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 63.0MB in the beginning and 765.3MB in the end (delta: -702.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 140 PlacesBefore, 49 PlacesAfterwards, 129 TransitionsBefore, 37 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2812, independent: 2735, independent conditional: 2735, 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: 2812, independent: 2735, independent conditional: 0, independent unconditional: 2735, 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: 2812, independent: 2735, independent conditional: 0, independent unconditional: 2735, 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: 2812, independent: 2735, independent conditional: 0, independent unconditional: 2735, 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: 2130, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2130, independent: 2056, independent conditional: 0, independent unconditional: 2056, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 336, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2812, independent: 660, independent conditional: 0, independent unconditional: 660, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2130, unknown conditional: 0, unknown unconditional: 2130] , Statistics on independence cache: Total cache size (in pairs): 3355, Positive cache size: 3300, Positive conditional cache size: 0, Positive unconditional cache size: 3300, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, 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, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 172, independent conditional: 172, 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: 204, independent: 172, independent conditional: 27, independent unconditional: 145, 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: 204, independent: 172, independent conditional: 27, independent unconditional: 145, 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: 204, independent: 172, independent conditional: 27, independent unconditional: 145, 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: 188, independent: 161, independent conditional: 24, independent unconditional: 137, 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: 188, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 124, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 120, dependent conditional: 71, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, independent: 11, independent conditional: 3, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 188, unknown conditional: 34, unknown unconditional: 154] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 161, Positive conditional cache size: 24, Positive unconditional cache size: 137, 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.1s, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 207, independent: 187, independent conditional: 187, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 207, independent: 187, independent conditional: 39, independent unconditional: 148, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 207, independent: 187, independent conditional: 10, independent unconditional: 177, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 207, independent: 187, independent conditional: 10, independent unconditional: 177, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 207, independent: 159, independent conditional: 10, independent unconditional: 149, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 189, Positive conditional cache size: 24, Positive unconditional cache size: 165, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243, independent: 217, independent conditional: 217, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 243, independent: 217, independent conditional: 28, independent unconditional: 189, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243, independent: 217, independent conditional: 7, independent unconditional: 210, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243, independent: 217, independent conditional: 7, independent unconditional: 210, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 243, independent: 213, independent conditional: 7, independent unconditional: 206, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 193, Positive conditional cache size: 24, Positive unconditional cache size: 169, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, independent: 279, independent conditional: 279, 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: 315, independent: 279, independent conditional: 49, independent unconditional: 230, dependent: 36, dependent conditional: 3, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, independent: 279, independent conditional: 0, independent unconditional: 279, 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: 315, independent: 279, independent conditional: 0, independent unconditional: 279, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, independent: 278, independent conditional: 0, independent unconditional: 278, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 194, Positive conditional cache size: 24, Positive unconditional cache size: 170, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 872 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 220, independent conditional: 220, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 254, independent: 220, independent conditional: 8, independent unconditional: 212, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 254, independent: 220, independent conditional: 8, independent unconditional: 212, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 254, independent: 220, independent conditional: 8, independent unconditional: 212, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 254, independent: 220, independent conditional: 8, independent unconditional: 212, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 194, Positive conditional cache size: 24, Positive unconditional cache size: 170, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, 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, 56 PlacesBefore, 56 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 996 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 224, independent conditional: 224, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 224, independent conditional: 8, independent unconditional: 216, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 224, independent conditional: 8, independent unconditional: 216, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 224, independent conditional: 8, independent unconditional: 216, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 262, independent: 224, independent conditional: 8, independent unconditional: 216, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 194, Positive conditional cache size: 24, Positive unconditional cache size: 170, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 314, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 314, independent: 272, independent conditional: 130, independent unconditional: 142, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 314, independent: 272, independent conditional: 69, independent unconditional: 203, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 314, independent: 272, independent conditional: 69, independent unconditional: 203, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 314, independent: 267, independent conditional: 66, independent unconditional: 201, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 199, Positive conditional cache size: 27, Positive unconditional cache size: 172, Negative cache size: 44, Negative conditional cache size: 10, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 395, independent: 346, independent conditional: 346, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 395, independent: 346, independent conditional: 141, independent unconditional: 205, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 395, independent: 346, independent conditional: 65, independent unconditional: 281, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 395, independent: 346, independent conditional: 65, independent unconditional: 281, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 395, independent: 340, independent conditional: 62, independent unconditional: 278, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 205, Positive conditional cache size: 30, Positive unconditional cache size: 175, Negative cache size: 44, Negative conditional cache size: 10, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 81, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 70 PlacesBefore, 70 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 474, independent: 426, independent conditional: 426, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 474, independent: 426, independent conditional: 336, independent unconditional: 90, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 502, independent: 426, independent conditional: 250, independent unconditional: 176, dependent: 76, dependent conditional: 24, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 502, independent: 426, independent conditional: 250, independent unconditional: 176, dependent: 76, dependent conditional: 24, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 502, independent: 417, independent conditional: 246, independent unconditional: 171, dependent: 73, dependent conditional: 21, dependent unconditional: 52, unknown: 12, unknown conditional: 7, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 217, Positive conditional cache size: 34, Positive unconditional cache size: 183, Negative cache size: 47, Negative conditional cache size: 13, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 138, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 71 PlacesBefore, 69 PlacesAfterwards, 66 TransitionsBefore, 64 TransitionsAfterwards, 842 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, independent: 222, independent conditional: 222, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 264, independent: 222, independent conditional: 166, independent unconditional: 56, dependent: 42, dependent conditional: 34, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 264, independent: 222, independent conditional: 122, independent unconditional: 100, dependent: 42, dependent conditional: 34, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 264, independent: 222, independent conditional: 122, independent unconditional: 100, dependent: 42, dependent conditional: 34, dependent unconditional: 8, 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: 1, dependent unconditional: 0, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 264, independent: 221, independent conditional: 122, independent unconditional: 99, dependent: 41, dependent conditional: 33, dependent unconditional: 8, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 228, Positive conditional cache size: 34, Positive unconditional cache size: 194, Negative cache size: 48, Negative conditional cache size: 14, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 134, independent conditional: 134, 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: 152, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 134, independent conditional: 113, independent unconditional: 21, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 134, independent conditional: 113, independent unconditional: 21, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 131, independent conditional: 110, independent unconditional: 21, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 231, Positive conditional cache size: 37, Positive unconditional cache size: 194, Negative cache size: 48, Negative conditional cache size: 14, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 74 PlacesBefore, 72 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 267, independent: 247, independent conditional: 154, independent unconditional: 93, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 267, independent: 247, independent conditional: 139, independent unconditional: 108, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 267, independent: 247, independent conditional: 139, independent unconditional: 108, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 36, independent conditional: 15, independent unconditional: 21, 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: 37, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 62, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 267, independent: 211, independent conditional: 124, independent unconditional: 87, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 37, unknown conditional: 15, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 361, Positive conditional cache size: 60, Positive unconditional cache size: 301, Negative cache size: 49, Negative conditional cache size: 14, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 361, Positive conditional cache size: 60, Positive unconditional cache size: 301, Negative cache size: 51, Negative conditional cache size: 16, Negative unconditional cache size: 35, 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, 72 PlacesBefore, 70 PlacesAfterwards, 43 TransitionsBefore, 41 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 25, independent conditional: 21, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 25, independent conditional: 21, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 25, independent conditional: 21, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 397, Positive conditional cache size: 63, Positive unconditional cache size: 334, Negative cache size: 51, Negative conditional cache size: 16, Negative unconditional cache size: 35, 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.4s, 66 PlacesBefore, 65 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 76, independent conditional: 68, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 76, independent conditional: 68, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 76, independent conditional: 68, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 66, independent conditional: 59, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 427, Positive conditional cache size: 72, Positive unconditional cache size: 355, Negative cache size: 51, Negative conditional cache size: 16, Negative unconditional cache size: 35, 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_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool 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 t353; [L872] FCALL, FORK 0 pthread_create(&t353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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(&t353, ((void *)0), P0, ((void *)0))=-3, t353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t354; [L874] FCALL, FORK 0 pthread_create(&t354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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(&t354, ((void *)0), P1, ((void *)0))=-2, t353={5:0}, t354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t355; [L876] FCALL, FORK 0 pthread_create(&t355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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(&t355, ((void *)0), P2, ((void *)0))=-1, t353={5:0}, t354={6:0}, t355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t356; [L878] FCALL, FORK 0 pthread_create(&t356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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(&t356, ((void *)0), P3, ((void *)0))=0, t353={5:0}, t354={6:0}, t355={7:0}, t356={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 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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 = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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] [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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] [L807] 3 y = 1 [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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] [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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, x=2, y=1, z=1] [L793] 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) [L794] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L795] 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 [L796] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L797] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, x=2, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 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 [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 == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=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=0, 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: 32.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1787 IncrementalHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 54 mSDtfsCounter, 1787 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=11, InterpolantAutomatonStates: 73, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 2535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:19:14,184 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...