/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:32:19,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:32:19,167 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:32:19,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:32:19,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:32:19,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:32:19,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:32:19,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:32:19,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:32:19,223 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:32:19,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:32:19,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:32:19,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:32:19,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:32:19,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:32:19,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:32:19,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:32:19,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:32:19,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:32:19,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:32:19,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:32:19,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:32:19,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:32:19,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:32:19,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:32:19,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:32:19,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:32:19,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:32:19,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:32:19,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:32:19,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:32:19,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:32:19,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:32:19,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:32:19,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:32:19,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:32:19,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:32:19,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:32:19,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:32:19,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:32:19,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:32:19,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:32:19,310 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:32:19,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:32:19,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:32:19,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:32:19,312 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:32:19,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:32:19,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:32:19,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:32:19,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:32:19,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:32:19,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:32:19,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:32:19,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:32:19,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:32:19,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:32:19,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:32:19,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:32:19,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:32:19,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:32:19,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:32:19,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:32:19,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:32:19,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:32:19,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:32:19,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:32:19,317 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:32:19,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:32:19,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:32:19,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:32:19,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:32:19,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:32:19,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:32:19,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:32:19,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:32:19,662 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:32:19,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:32:20,928 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:32:21,184 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:32:21,185 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:32:21,215 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb039a38/ba1cbbbfa5e34195b7c1ad8efd336365/FLAG25af224fb [2022-12-13 09:32:21,226 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eb039a38/ba1cbbbfa5e34195b7c1ad8efd336365 [2022-12-13 09:32:21,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:32:21,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:32:21,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:32:21,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:32:21,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:32:21,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452eb877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21, skipping insertion in model container [2022-12-13 09:32:21,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:32:21,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:32:21,412 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 09:32:21,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:32:21,660 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:32:21,672 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 09:32:21,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:32:21,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:32:21,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:32:21,754 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:32:21,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21 WrapperNode [2022-12-13 09:32:21,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:32:21,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:32:21,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:32:21,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:32:21,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,825 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 09:32:21,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:32:21,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:32:21,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:32:21,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:32:21,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,862 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:32:21,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:32:21,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:32:21,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:32:21,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (1/1) ... [2022-12-13 09:32:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:32:21,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:32:21,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:32:21,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:32:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:32:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:32:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:32:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:32:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:32:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:32:21,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:32:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:32:21,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:32:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:32:21,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:32:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:32:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:32:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:32:21,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:32:21,958 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:32:22,160 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:32:22,162 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:32:22,442 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:32:22,552 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:32:22,553 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:32:22,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:32:22 BoogieIcfgContainer [2022-12-13 09:32:22,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:32:22,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:32:22,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:32:22,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:32:22,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:32:21" (1/3) ... [2022-12-13 09:32:22,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e350a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:32:22, skipping insertion in model container [2022-12-13 09:32:22,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:32:21" (2/3) ... [2022-12-13 09:32:22,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e350a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:32:22, skipping insertion in model container [2022-12-13 09:32:22,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:32:22" (3/3) ... [2022-12-13 09:32:22,563 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 09:32:22,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:32:22,578 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:32:22,578 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:32:22,628 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:32:22,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 09:32:22,712 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 09:32:22,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:32:22,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:32:22,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 09:32:22,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-13 09:32:22,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:22,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 09:32:22,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-13 09:32:22,810 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 09:32:22,811 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:32:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:32:22,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 09:32:22,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 09:32:27,323 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 09:32:27,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:32:27,358 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;@6374efa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:32:27,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:32:27,367 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 09:32:27,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:32:27,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:27,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:32:27,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 465769078, now seen corresponding path program 1 times [2022-12-13 09:32:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:27,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053853189] [2022-12-13 09:32:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:27,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053853189] [2022-12-13 09:32:27,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053853189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:27,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:27,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:32:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947733533] [2022-12-13 09:32:27,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:27,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:32:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:27,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:32:27,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:32:27,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 63 [2022-12-13 09:32:27,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:27,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:27,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 63 [2022-12-13 09:32:27,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:28,993 INFO L130 PetriNetUnfolder]: 7324/11563 cut-off events. [2022-12-13 09:32:28,993 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 09:32:29,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22115 conditions, 11563 events. 7324/11563 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 79303 event pairs, 2048 based on Foata normal form. 0/7186 useless extension candidates. Maximal degree in co-relation 22104. Up to 8877 conditions per place. [2022-12-13 09:32:29,037 INFO L137 encePairwiseOnDemand]: 55/63 looper letters, 32 selfloop transitions, 2 changer transitions 49/94 dead transitions. [2022-12-13 09:32:29,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 364 flow [2022-12-13 09:32:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:32:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-12-13 09:32:29,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2022-12-13 09:32:29,049 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 135 flow. Second operand 3 states and 129 transitions. [2022-12-13 09:32:29,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 364 flow [2022-12-13 09:32:29,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:32:29,054 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 74 flow [2022-12-13 09:32:29,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2022-12-13 09:32:29,059 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 09:32:29,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:29,060 INFO L89 Accepts]: Start accepts. Operand has 66 places, 32 transitions, 74 flow [2022-12-13 09:32:29,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:29,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:29,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 32 transitions, 74 flow [2022-12-13 09:32:29,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 09:32:29,068 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:32:29,068 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:32:29,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:32:29,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 09:32:29,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 09:32:29,193 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:29,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 09:32:29,194 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 09:32:29,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:29,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:29,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:29,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:32:29,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:29,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2070113844, now seen corresponding path program 1 times [2022-12-13 09:32:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:29,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531266257] [2022-12-13 09:32:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:29,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531266257] [2022-12-13 09:32:29,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531266257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:29,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:29,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:32:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754550306] [2022-12-13 09:32:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:29,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:32:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:32:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:32:29,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:32:29,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:29,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:29,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:32:29,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:29,998 INFO L130 PetriNetUnfolder]: 3457/5416 cut-off events. [2022-12-13 09:32:29,998 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 09:32:30,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10882 conditions, 5416 events. 3457/5416 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32225 event pairs, 1263 based on Foata normal form. 0/4354 useless extension candidates. Maximal degree in co-relation 10872. Up to 2682 conditions per place. [2022-12-13 09:32:30,023 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 36 selfloop transitions, 6 changer transitions 2/52 dead transitions. [2022-12-13 09:32:30,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 208 flow [2022-12-13 09:32:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:32:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 09:32:30,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 09:32:30,026 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 69 transitions. [2022-12-13 09:32:30,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 208 flow [2022-12-13 09:32:30,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:30,029 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 110 flow [2022-12-13 09:32:30,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 09:32:30,030 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2022-12-13 09:32:30,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:30,030 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 110 flow [2022-12-13 09:32:30,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:30,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:30,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 110 flow [2022-12-13 09:32:30,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 110 flow [2022-12-13 09:32:30,050 INFO L130 PetriNetUnfolder]: 46/215 cut-off events. [2022-12-13 09:32:30,051 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 09:32:30,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 215 events. 46/215 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1309 event pairs, 16 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 356. Up to 56 conditions per place. [2022-12-13 09:32:30,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 110 flow [2022-12-13 09:32:30,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 09:32:30,134 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:30,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 09:32:30,136 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 110 flow [2022-12-13 09:32:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:30,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:30,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:30,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:32:30,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash 250980955, now seen corresponding path program 1 times [2022-12-13 09:32:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:30,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446465603] [2022-12-13 09:32:30,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:30,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446465603] [2022-12-13 09:32:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446465603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:30,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:30,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559802315] [2022-12-13 09:32:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:30,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:30,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:32:30,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:30,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:30,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:32:30,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:30,727 INFO L130 PetriNetUnfolder]: 2587/4134 cut-off events. [2022-12-13 09:32:30,728 INFO L131 PetriNetUnfolder]: For 1293/1293 co-relation queries the response was YES. [2022-12-13 09:32:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9710 conditions, 4134 events. 2587/4134 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23196 event pairs, 410 based on Foata normal form. 24/3438 useless extension candidates. Maximal degree in co-relation 9698. Up to 1765 conditions per place. [2022-12-13 09:32:30,749 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 7 changer transitions 4/59 dead transitions. [2022-12-13 09:32:30,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 276 flow [2022-12-13 09:32:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 09:32:30,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-13 09:32:30,751 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 110 flow. Second operand 4 states and 81 transitions. [2022-12-13 09:32:30,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 276 flow [2022-12-13 09:32:30,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:30,758 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 140 flow [2022-12-13 09:32:30,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 09:32:30,759 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-13 09:32:30,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:30,759 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 140 flow [2022-12-13 09:32:30,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:30,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:30,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 140 flow [2022-12-13 09:32:30,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 140 flow [2022-12-13 09:32:30,775 INFO L130 PetriNetUnfolder]: 33/178 cut-off events. [2022-12-13 09:32:30,775 INFO L131 PetriNetUnfolder]: For 87/100 co-relation queries the response was YES. [2022-12-13 09:32:30,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 178 events. 33/178 cut-off events. For 87/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1031 event pairs, 10 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 336. Up to 44 conditions per place. [2022-12-13 09:32:30,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 140 flow [2022-12-13 09:32:30,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 09:32:30,851 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:30,852 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 09:32:30,852 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 140 flow [2022-12-13 09:32:30,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:30,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:30,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:32:30,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -809575241, now seen corresponding path program 1 times [2022-12-13 09:32:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:30,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853810830] [2022-12-13 09:32:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853810830] [2022-12-13 09:32:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853810830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:31,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:31,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484611095] [2022-12-13 09:32:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:31,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:32:31,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:31,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:31,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:32:31,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:31,428 INFO L130 PetriNetUnfolder]: 2433/3915 cut-off events. [2022-12-13 09:32:31,429 INFO L131 PetriNetUnfolder]: For 2804/2804 co-relation queries the response was YES. [2022-12-13 09:32:31,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9730 conditions, 3915 events. 2433/3915 cut-off events. For 2804/2804 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 21710 event pairs, 695 based on Foata normal form. 24/3253 useless extension candidates. Maximal degree in co-relation 9715. Up to 1308 conditions per place. [2022-12-13 09:32:31,444 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 43 selfloop transitions, 6 changer transitions 4/61 dead transitions. [2022-12-13 09:32:31,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 316 flow [2022-12-13 09:32:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 09:32:31,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-13 09:32:31,446 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 140 flow. Second operand 4 states and 80 transitions. [2022-12-13 09:32:31,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 316 flow [2022-12-13 09:32:31,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:32:31,451 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 183 flow [2022-12-13 09:32:31,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 09:32:31,452 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -18 predicate places. [2022-12-13 09:32:31,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:31,452 INFO L89 Accepts]: Start accepts. Operand has 51 places, 39 transitions, 183 flow [2022-12-13 09:32:31,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:31,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:31,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 183 flow [2022-12-13 09:32:31,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 183 flow [2022-12-13 09:32:31,466 INFO L130 PetriNetUnfolder]: 21/134 cut-off events. [2022-12-13 09:32:31,466 INFO L131 PetriNetUnfolder]: For 113/122 co-relation queries the response was YES. [2022-12-13 09:32:31,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 134 events. 21/134 cut-off events. For 113/122 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 684 event pairs, 6 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 294. Up to 34 conditions per place. [2022-12-13 09:32:31,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 183 flow [2022-12-13 09:32:31,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-13 09:32:31,481 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:31,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 09:32:31,482 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 183 flow [2022-12-13 09:32:31,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:31,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:31,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:31,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:32:31,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1440806137, now seen corresponding path program 1 times [2022-12-13 09:32:31,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912186942] [2022-12-13 09:32:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:31,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:31,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912186942] [2022-12-13 09:32:31,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912186942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:31,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:31,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681547855] [2022-12-13 09:32:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:31,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:31,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:32:31,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:31,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:31,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:32:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:32,174 INFO L130 PetriNetUnfolder]: 3359/5431 cut-off events. [2022-12-13 09:32:32,174 INFO L131 PetriNetUnfolder]: For 6494/6494 co-relation queries the response was YES. [2022-12-13 09:32:32,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14076 conditions, 5431 events. 3359/5431 cut-off events. For 6494/6494 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33903 event pairs, 595 based on Foata normal form. 96/4497 useless extension candidates. Maximal degree in co-relation 14057. Up to 2620 conditions per place. [2022-12-13 09:32:32,199 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 51 selfloop transitions, 9 changer transitions 14/82 dead transitions. [2022-12-13 09:32:32,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 490 flow [2022-12-13 09:32:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:32:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 09:32:32,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-13 09:32:32,203 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 183 flow. Second operand 5 states and 105 transitions. [2022-12-13 09:32:32,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 490 flow [2022-12-13 09:32:32,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:32,227 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 230 flow [2022-12-13 09:32:32,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 09:32:32,229 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -14 predicate places. [2022-12-13 09:32:32,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:32,229 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 230 flow [2022-12-13 09:32:32,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:32,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:32,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 230 flow [2022-12-13 09:32:32,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 230 flow [2022-12-13 09:32:32,242 INFO L130 PetriNetUnfolder]: 16/125 cut-off events. [2022-12-13 09:32:32,242 INFO L131 PetriNetUnfolder]: For 121/126 co-relation queries the response was YES. [2022-12-13 09:32:32,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 125 events. 16/125 cut-off events. For 121/126 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 656 event pairs, 3 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 285. Up to 30 conditions per place. [2022-12-13 09:32:32,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 230 flow [2022-12-13 09:32:32,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 09:32:32,276 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:32,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 09:32:32,278 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 230 flow [2022-12-13 09:32:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:32,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:32,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:32,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:32:32,278 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:32,279 INFO L85 PathProgramCache]: Analyzing trace with hash -565447153, now seen corresponding path program 1 times [2022-12-13 09:32:32,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:32,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447860484] [2022-12-13 09:32:32,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:32,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447860484] [2022-12-13 09:32:32,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447860484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:32,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:32,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:32:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775560740] [2022-12-13 09:32:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:32,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:32,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:32:32,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:32,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:32,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:32:32,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:33,207 INFO L130 PetriNetUnfolder]: 3801/6150 cut-off events. [2022-12-13 09:32:33,207 INFO L131 PetriNetUnfolder]: For 7875/7875 co-relation queries the response was YES. [2022-12-13 09:32:33,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15839 conditions, 6150 events. 3801/6150 cut-off events. For 7875/7875 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 38981 event pairs, 789 based on Foata normal form. 120/4988 useless extension candidates. Maximal degree in co-relation 15818. Up to 1554 conditions per place. [2022-12-13 09:32:33,226 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 47 selfloop transitions, 10 changer transitions 36/101 dead transitions. [2022-12-13 09:32:33,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 580 flow [2022-12-13 09:32:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:32:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:32:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-13 09:32:33,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6682027649769585 [2022-12-13 09:32:33,228 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 230 flow. Second operand 7 states and 145 transitions. [2022-12-13 09:32:33,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 580 flow [2022-12-13 09:32:33,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 554 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 09:32:33,248 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 207 flow [2022-12-13 09:32:33,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2022-12-13 09:32:33,249 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2022-12-13 09:32:33,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:33,249 INFO L89 Accepts]: Start accepts. Operand has 62 places, 39 transitions, 207 flow [2022-12-13 09:32:33,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:33,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:33,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 39 transitions, 207 flow [2022-12-13 09:32:33,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 39 transitions, 207 flow [2022-12-13 09:32:33,258 INFO L130 PetriNetUnfolder]: 7/82 cut-off events. [2022-12-13 09:32:33,258 INFO L131 PetriNetUnfolder]: For 104/108 co-relation queries the response was YES. [2022-12-13 09:32:33,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 82 events. 7/82 cut-off events. For 104/108 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 1 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 181. Up to 18 conditions per place. [2022-12-13 09:32:33,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 39 transitions, 207 flow [2022-12-13 09:32:33,260 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 09:32:33,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] $Ultimate##0-->L804: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_14 v_~__unbuffered_p2_EAX~0_15)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_14} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [321] L784-->L787: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 09:32:33,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] $Ultimate##0-->L787: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_39 |v_P2Thread1of1ForFork1_#in~arg.base_39|) (= v_~y~0_141 1) (= v_P2Thread1of1ForFork1_~arg.offset_39 |v_P2Thread1of1ForFork1_#in~arg.offset_39|) (= v_~y~0_142 v_~__unbuffered_p2_EAX~0_127)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_39|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_39|, ~y~0=v_~y~0_142} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_39|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_39, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_127, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_39|, ~y~0=v_~y~0_141} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [328] L804-->L807: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-13 09:32:33,321 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:32:33,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 09:32:33,322 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 207 flow [2022-12-13 09:32:33,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:33,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:33,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:33,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:32:33,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash -963014169, now seen corresponding path program 1 times [2022-12-13 09:32:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:33,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920659687] [2022-12-13 09:32:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920659687] [2022-12-13 09:32:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920659687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:33,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:33,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504716465] [2022-12-13 09:32:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:33,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:32:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:32:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:32:33,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 09:32:33,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:33,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:33,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 09:32:33,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:33,888 INFO L130 PetriNetUnfolder]: 2724/4213 cut-off events. [2022-12-13 09:32:33,888 INFO L131 PetriNetUnfolder]: For 6005/6015 co-relation queries the response was YES. [2022-12-13 09:32:33,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10708 conditions, 4213 events. 2724/4213 cut-off events. For 6005/6015 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23088 event pairs, 921 based on Foata normal form. 42/2767 useless extension candidates. Maximal degree in co-relation 10683. Up to 4063 conditions per place. [2022-12-13 09:32:33,905 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 36 selfloop transitions, 10 changer transitions 4/59 dead transitions. [2022-12-13 09:32:33,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 400 flow [2022-12-13 09:32:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:32:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:32:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 09:32:33,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2022-12-13 09:32:33,907 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 207 flow. Second operand 3 states and 67 transitions. [2022-12-13 09:32:33,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 400 flow [2022-12-13 09:32:33,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 348 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-12-13 09:32:33,915 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 237 flow [2022-12-13 09:32:33,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 09:32:33,915 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -15 predicate places. [2022-12-13 09:32:33,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:33,916 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 237 flow [2022-12-13 09:32:33,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:33,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:33,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 237 flow [2022-12-13 09:32:33,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 237 flow [2022-12-13 09:32:33,984 INFO L130 PetriNetUnfolder]: 704/1270 cut-off events. [2022-12-13 09:32:33,984 INFO L131 PetriNetUnfolder]: For 135/149 co-relation queries the response was YES. [2022-12-13 09:32:33,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1270 events. 704/1270 cut-off events. For 135/149 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 8119 event pairs, 334 based on Foata normal form. 9/660 useless extension candidates. Maximal degree in co-relation 2581. Up to 1096 conditions per place. [2022-12-13 09:32:33,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 237 flow [2022-12-13 09:32:33,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 09:32:34,039 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:34,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 09:32:34,041 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 237 flow [2022-12-13 09:32:34,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:34,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:34,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:34,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:32:34,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 311605133, now seen corresponding path program 1 times [2022-12-13 09:32:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:34,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652598030] [2022-12-13 09:32:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:34,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652598030] [2022-12-13 09:32:34,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652598030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:34,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:34,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177967741] [2022-12-13 09:32:34,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:34,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:34,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:34,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:34,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 09:32:34,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:34,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:34,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 09:32:34,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:34,580 INFO L130 PetriNetUnfolder]: 2356/3803 cut-off events. [2022-12-13 09:32:34,581 INFO L131 PetriNetUnfolder]: For 3087/3199 co-relation queries the response was YES. [2022-12-13 09:32:34,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11186 conditions, 3803 events. 2356/3803 cut-off events. For 3087/3199 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 22217 event pairs, 947 based on Foata normal form. 114/3071 useless extension candidates. Maximal degree in co-relation 11166. Up to 2450 conditions per place. [2022-12-13 09:32:34,596 INFO L137 encePairwiseOnDemand]: 27/32 looper letters, 41 selfloop transitions, 3 changer transitions 17/70 dead transitions. [2022-12-13 09:32:34,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 440 flow [2022-12-13 09:32:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 09:32:34,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.609375 [2022-12-13 09:32:34,598 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 237 flow. Second operand 4 states and 78 transitions. [2022-12-13 09:32:34,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 440 flow [2022-12-13 09:32:34,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 70 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:32:34,602 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 164 flow [2022-12-13 09:32:34,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2022-12-13 09:32:34,603 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -14 predicate places. [2022-12-13 09:32:34,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:34,603 INFO L89 Accepts]: Start accepts. Operand has 55 places, 38 transitions, 164 flow [2022-12-13 09:32:34,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:34,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:34,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 38 transitions, 164 flow [2022-12-13 09:32:34,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 164 flow [2022-12-13 09:32:34,630 INFO L130 PetriNetUnfolder]: 277/500 cut-off events. [2022-12-13 09:32:34,630 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 09:32:34,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 500 events. 277/500 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 2657 event pairs, 142 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 1019. Up to 448 conditions per place. [2022-12-13 09:32:34,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 164 flow [2022-12-13 09:32:34,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 09:32:34,742 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:32:34,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 09:32:34,743 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 162 flow [2022-12-13 09:32:34,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:34,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:34,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:34,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:32:34,744 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1460451491, now seen corresponding path program 1 times [2022-12-13 09:32:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766456815] [2022-12-13 09:32:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766456815] [2022-12-13 09:32:34,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766456815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:34,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:34,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:32:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284880266] [2022-12-13 09:32:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:34,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:34,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:34,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 09:32:34,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:34,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:34,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 09:32:34,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:35,213 INFO L130 PetriNetUnfolder]: 1652/2641 cut-off events. [2022-12-13 09:32:35,214 INFO L131 PetriNetUnfolder]: For 2909/2979 co-relation queries the response was YES. [2022-12-13 09:32:35,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7749 conditions, 2641 events. 1652/2641 cut-off events. For 2909/2979 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 14704 event pairs, 825 based on Foata normal form. 103/2133 useless extension candidates. Maximal degree in co-relation 7729. Up to 1713 conditions per place. [2022-12-13 09:32:35,227 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 32 selfloop transitions, 3 changer transitions 16/59 dead transitions. [2022-12-13 09:32:35,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 355 flow [2022-12-13 09:32:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 09:32:35,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 09:32:35,229 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 162 flow. Second operand 4 states and 63 transitions. [2022-12-13 09:32:35,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 355 flow [2022-12-13 09:32:35,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 323 flow, removed 2 selfloop flow, removed 10 redundant places. [2022-12-13 09:32:35,235 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 147 flow [2022-12-13 09:32:35,235 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 09:32:35,236 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-13 09:32:35,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:35,237 INFO L89 Accepts]: Start accepts. Operand has 46 places, 36 transitions, 147 flow [2022-12-13 09:32:35,238 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:35,238 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:35,238 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 147 flow [2022-12-13 09:32:35,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 147 flow [2022-12-13 09:32:35,284 INFO L130 PetriNetUnfolder]: 258/504 cut-off events. [2022-12-13 09:32:35,284 INFO L131 PetriNetUnfolder]: For 46/47 co-relation queries the response was YES. [2022-12-13 09:32:35,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 504 events. 258/504 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3017 event pairs, 123 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1021. Up to 406 conditions per place. [2022-12-13 09:32:35,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 147 flow [2022-12-13 09:32:35,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 09:32:35,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:32:35,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 09:32:35,362 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 143 flow [2022-12-13 09:32:35,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:35,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:35,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:35,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:32:35,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1515771777, now seen corresponding path program 1 times [2022-12-13 09:32:35,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:35,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304890140] [2022-12-13 09:32:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:35,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304890140] [2022-12-13 09:32:35,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304890140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:35,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:35,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:32:35,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534160068] [2022-12-13 09:32:35,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:35,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:32:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:35,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:32:35,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:32:35,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 09:32:35,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-13 09:32:35,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:35,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 09:32:35,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:35,655 INFO L130 PetriNetUnfolder]: 572/1008 cut-off events. [2022-12-13 09:32:35,655 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2022-12-13 09:32:35,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2963 conditions, 1008 events. 572/1008 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5014 event pairs, 95 based on Foata normal form. 51/721 useless extension candidates. Maximal degree in co-relation 2948. Up to 847 conditions per place. [2022-12-13 09:32:35,661 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 34 selfloop transitions, 19 changer transitions 0/55 dead transitions. [2022-12-13 09:32:35,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 328 flow [2022-12-13 09:32:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:32:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:32:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 09:32:35,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-13 09:32:35,664 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 143 flow. Second operand 4 states and 62 transitions. [2022-12-13 09:32:35,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 328 flow [2022-12-13 09:32:35,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 305 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 09:32:35,667 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 239 flow [2022-12-13 09:32:35,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2022-12-13 09:32:35,667 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2022-12-13 09:32:35,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:35,668 INFO L89 Accepts]: Start accepts. Operand has 43 places, 44 transitions, 239 flow [2022-12-13 09:32:35,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:35,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:35,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 44 transitions, 239 flow [2022-12-13 09:32:35,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 44 transitions, 239 flow [2022-12-13 09:32:35,705 INFO L130 PetriNetUnfolder]: 198/446 cut-off events. [2022-12-13 09:32:35,706 INFO L131 PetriNetUnfolder]: For 24/42 co-relation queries the response was YES. [2022-12-13 09:32:35,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 446 events. 198/446 cut-off events. For 24/42 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 2704 event pairs, 63 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 1191. Up to 307 conditions per place. [2022-12-13 09:32:35,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 44 transitions, 239 flow [2022-12-13 09:32:35,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 09:32:35,727 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:32:35,730 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 09:32:35,730 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 239 flow [2022-12-13 09:32:35,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-13 09:32:35,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:35,730 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:35,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:32:35,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1590209714, now seen corresponding path program 1 times [2022-12-13 09:32:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:35,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709269401] [2022-12-13 09:32:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:35,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:35,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709269401] [2022-12-13 09:32:35,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709269401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:35,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:35,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:32:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891089282] [2022-12-13 09:32:35,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:35,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:32:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:35,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:32:35,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:32:35,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-13 09:32:35,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:35,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:35,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-13 09:32:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:36,050 INFO L130 PetriNetUnfolder]: 230/486 cut-off events. [2022-12-13 09:32:36,050 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-13 09:32:36,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 486 events. 230/486 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2308 event pairs, 14 based on Foata normal form. 63/373 useless extension candidates. Maximal degree in co-relation 1796. Up to 292 conditions per place. [2022-12-13 09:32:36,053 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 25 selfloop transitions, 28 changer transitions 0/55 dead transitions. [2022-12-13 09:32:36,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 381 flow [2022-12-13 09:32:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:32:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:32:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 09:32:36,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2022-12-13 09:32:36,055 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 239 flow. Second operand 5 states and 64 transitions. [2022-12-13 09:32:36,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 381 flow [2022-12-13 09:32:36,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 331 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 09:32:36,058 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 271 flow [2022-12-13 09:32:36,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2022-12-13 09:32:36,058 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-13 09:32:36,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:36,058 INFO L89 Accepts]: Start accepts. Operand has 45 places, 44 transitions, 271 flow [2022-12-13 09:32:36,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:36,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:36,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 44 transitions, 271 flow [2022-12-13 09:32:36,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 271 flow [2022-12-13 09:32:36,076 INFO L130 PetriNetUnfolder]: 81/239 cut-off events. [2022-12-13 09:32:36,077 INFO L131 PetriNetUnfolder]: For 108/144 co-relation queries the response was YES. [2022-12-13 09:32:36,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 239 events. 81/239 cut-off events. For 108/144 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1273 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 784. Up to 163 conditions per place. [2022-12-13 09:32:36,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 44 transitions, 271 flow [2022-12-13 09:32:36,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-13 09:32:36,922 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:32:36,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 865 [2022-12-13 09:32:36,923 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 265 flow [2022-12-13 09:32:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:36,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:36,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:36,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:32:36,924 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:36,924 INFO L85 PathProgramCache]: Analyzing trace with hash -429580725, now seen corresponding path program 1 times [2022-12-13 09:32:36,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:36,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355747586] [2022-12-13 09:32:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:32:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:32:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:32:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355747586] [2022-12-13 09:32:37,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355747586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:32:37,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:32:37,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:32:37,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167256361] [2022-12-13 09:32:37,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:32:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:32:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:32:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:32:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:32:37,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 09:32:37,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:37,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:32:37,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 09:32:37,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:32:37,706 INFO L130 PetriNetUnfolder]: 269/514 cut-off events. [2022-12-13 09:32:37,706 INFO L131 PetriNetUnfolder]: For 636/670 co-relation queries the response was YES. [2022-12-13 09:32:37,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 514 events. 269/514 cut-off events. For 636/670 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2586 event pairs, 20 based on Foata normal form. 37/409 useless extension candidates. Maximal degree in co-relation 2210. Up to 370 conditions per place. [2022-12-13 09:32:37,709 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 32 selfloop transitions, 3 changer transitions 24/70 dead transitions. [2022-12-13 09:32:37,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 569 flow [2022-12-13 09:32:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:32:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:32:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-13 09:32:37,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-13 09:32:37,711 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 265 flow. Second operand 6 states and 66 transitions. [2022-12-13 09:32:37,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 569 flow [2022-12-13 09:32:37,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 443 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 09:32:37,715 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 203 flow [2022-12-13 09:32:37,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-13 09:32:37,716 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-13 09:32:37,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:32:37,716 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 203 flow [2022-12-13 09:32:37,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:32:37,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:32:37,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 203 flow [2022-12-13 09:32:37,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 203 flow [2022-12-13 09:32:37,731 INFO L130 PetriNetUnfolder]: 81/184 cut-off events. [2022-12-13 09:32:37,731 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-13 09:32:37,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 184 events. 81/184 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 864 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 508. Up to 109 conditions per place. [2022-12-13 09:32:37,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 203 flow [2022-12-13 09:32:37,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 09:32:37,764 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] $Ultimate##0-->L787: Formula: (and (= v_~x$r_buff0_thd1~0_241 v_~x$r_buff1_thd1~0_239) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_70| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_70| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|) (= v_~y~0_153 1) (= v_~x$w_buff0_used~0_633 v_~x$w_buff1_used~0_577) (= v_~x$r_buff0_thd0~0_217 v_~x$r_buff1_thd0~0_222) (= v_~x$r_buff0_thd3~0_186 v_~x$r_buff1_thd3~0_185) (= v_~x$w_buff0~0_413 v_~x$w_buff1~0_347) (= v_~x$w_buff0_used~0_632 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_64| |v_P1Thread1of1ForFork0_#in~arg#1.base_64|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_577 256) 0)) (not (= (mod v_~x$w_buff0_used~0_632 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|) (= v_~x$w_buff0~0_412 1) (= v_~x$r_buff0_thd2~0_212 1) (= v_~x$r_buff0_thd2~0_213 v_~x$r_buff1_thd2~0_162) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_64| |v_P1Thread1of1ForFork0_~arg#1.offset_64|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_413, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_217, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_64|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_241, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_186, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_64|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_633} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_412, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_217, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_70|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_241, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_64|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_64|, ~x$w_buff1~0=v_~x$w_buff1~0_347, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_185, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_577, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_70|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_186, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_222, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_64|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_632, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_64|, ~y~0=v_~y~0_153} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [476] $Ultimate##0-->L807: Formula: (and (= v_~y~0_155 v_~__unbuffered_p2_EBX~0_114) (= v_P2Thread1of1ForFork1_~arg.base_43 |v_P2Thread1of1ForFork1_#in~arg.base_43|) (= v_~y~0_155 v_~__unbuffered_p2_EAX~0_135) (= v_P2Thread1of1ForFork1_~arg.offset_43 |v_P2Thread1of1ForFork1_#in~arg.offset_43|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_155} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_43, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_135, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_155} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 09:32:37,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:32:37,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 09:32:37,896 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 201 flow [2022-12-13 09:32:37,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:32:37,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:32:37,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:37,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:32:37,896 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:32:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:32:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -697935650, now seen corresponding path program 1 times [2022-12-13 09:32:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:32:37,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658945440] [2022-12-13 09:32:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:32:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:32:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:32:37,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:32:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:32:37,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:32:37,982 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:32:37,983 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:32:37,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:32:37,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:32:37,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:32:37,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:32:37,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:32:37,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:32:37,985 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:32:37,990 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:32:37,990 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:32:38,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:32:38 BasicIcfg [2022-12-13 09:32:38,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:32:38,057 INFO L158 Benchmark]: Toolchain (without parser) took 16827.91ms. Allocated memory was 202.4MB in the beginning and 897.6MB in the end (delta: 695.2MB). Free memory was 177.3MB in the beginning and 666.3MB in the end (delta: -489.0MB). Peak memory consumption was 207.2MB. Max. memory is 8.0GB. [2022-12-13 09:32:38,057 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 202.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:32:38,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.55ms. Allocated memory is still 202.4MB. Free memory was 176.7MB in the beginning and 150.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 09:32:38,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.80ms. Allocated memory is still 202.4MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:32:38,058 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 202.4MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:32:38,058 INFO L158 Benchmark]: RCFGBuilder took 688.57ms. Allocated memory is still 202.4MB. Free memory was 146.3MB in the beginning and 114.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 09:32:38,058 INFO L158 Benchmark]: TraceAbstraction took 15499.21ms. Allocated memory was 202.4MB in the beginning and 897.6MB in the end (delta: 695.2MB). Free memory was 113.8MB in the beginning and 666.3MB in the end (delta: -552.5MB). Peak memory consumption was 143.2MB. Max. memory is 8.0GB. [2022-12-13 09:32:38,060 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.14ms. Allocated memory is still 202.4MB. Free memory is still 179.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.55ms. Allocated memory is still 202.4MB. Free memory was 176.7MB in the beginning and 150.5MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.80ms. Allocated memory is still 202.4MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 202.4MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 688.57ms. Allocated memory is still 202.4MB. Free memory was 146.3MB in the beginning and 114.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15499.21ms. Allocated memory was 202.4MB in the beginning and 897.6MB in the end (delta: 695.2MB). Free memory was 113.8MB in the beginning and 666.3MB in the end (delta: -552.5MB). Peak memory consumption was 143.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 112 PlacesBefore, 69 PlacesAfterwards, 104 TransitionsBefore, 63 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4047, independent: 3869, independent conditional: 3869, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2288, independent: 2234, independent conditional: 0, independent unconditional: 2234, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2288, independent: 2234, independent conditional: 0, independent unconditional: 2234, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2288, independent: 2187, independent conditional: 0, independent unconditional: 2187, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 265, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4047, independent: 1635, independent conditional: 1635, independent unconditional: 0, dependent: 124, dependent conditional: 124, dependent unconditional: 0, unknown: 2288, unknown conditional: 2288, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2296, Positive cache size: 2242, Positive conditional cache size: 2242, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 143, independent conditional: 10, independent unconditional: 133, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, independent: 143, independent conditional: 10, independent unconditional: 133, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 97, dependent conditional: 15, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 167, unknown conditional: 167, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 143, Positive conditional cache size: 143, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 54, independent conditional: 17, independent unconditional: 37, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 54, independent conditional: 17, independent unconditional: 37, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 197, Positive conditional cache size: 197, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 160, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 13, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 13, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 237, Positive conditional cache size: 237, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 250, Positive conditional cache size: 250, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 11, independent unconditional: 17, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 11, independent unconditional: 17, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 22, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 278, Positive conditional cache size: 278, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 59 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 354, independent: 305, independent conditional: 305, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 33, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 33, independent unconditional: 17, 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: 50, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 354, independent: 255, independent conditional: 255, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 328, Positive conditional cache size: 328, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 25, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 332, Positive conditional cache size: 332, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 5, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 5, independent unconditional: 12, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 122, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 349, Positive conditional cache size: 349, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 9, independent unconditional: 19, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 9, independent unconditional: 19, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 377, Positive conditional cache size: 377, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 13, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 396, Positive conditional cache size: 396, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 45 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 41 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 17, independent unconditional: 0, 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: 18, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 413, Positive conditional cache size: 413, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 467, Positive cache size: 418, Positive conditional cache size: 418, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-2, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-1, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1899, ((void *)0), P2, ((void *)0))=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 [L803] 2 __unbuffered_p2_EAX = y [L806] 2 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 y = 2 [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 392 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 11 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=11, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:32:38,102 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...