/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:23:46,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:23:46,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:23:46,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:23:46,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:23:46,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:23:46,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:23:46,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:23:46,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:23:46,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:23:46,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:23:46,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:23:46,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:23:46,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:23:46,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:23:46,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:23:46,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:23:46,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:23:46,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:23:46,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:23:46,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:23:46,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:23:46,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:23:46,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:23:46,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:23:46,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:23:46,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:23:46,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:23:46,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:23:46,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:23:46,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:23:46,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:23:46,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:23:46,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:23:46,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:23:46,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:23:46,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:23:46,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:23:46,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:23:46,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:23:46,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:23:46,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:23:46,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:23:46,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:23:46,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:23:46,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:23:46,425 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:23:46,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:23:46,426 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:23:46,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:23:46,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:23:46,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:23:46,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:23:46,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:23:46,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:23:46,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:23:46,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:23:46,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:23:46,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:23:46,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:23:46,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:23:46,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:23:46,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:23:46,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:23:46,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:23:46,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:23:46,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:23:46,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:23:46,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:23:46,700 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:23:46,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-12-06 06:23:47,741 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:23:47,988 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:23:47,988 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2022-12-06 06:23:48,038 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9abdd12/5568e9c7e74d4e9280198a86669c34c4/FLAG8a6d8a84a [2022-12-06 06:23:48,048 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf9abdd12/5568e9c7e74d4e9280198a86669c34c4 [2022-12-06 06:23:48,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:23:48,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:23:48,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:23:48,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:23:48,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:23:48,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fea7a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48, skipping insertion in model container [2022-12-06 06:23:48,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:23:48,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:23:48,207 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/mix033.opt.i[944,957] [2022-12-06 06:23:48,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:23:48,419 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:23:48,427 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/mix033.opt.i[944,957] [2022-12-06 06:23:48,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:23:48,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:23:48,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:23:48,497 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:23:48,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48 WrapperNode [2022-12-06 06:23:48,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:23:48,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:23:48,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:23:48,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:23:48,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,555 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-12-06 06:23:48,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:23:48,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:23:48,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:23:48,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:23:48,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:23:48,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:23:48,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:23:48,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:23:48,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (1/1) ... [2022-12-06 06:23:48,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:23:48,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:23:48,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:23:48,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:23:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:23:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:23:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:23:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:23:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:23:48,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:23:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:23:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:23:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:23:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:23:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:23:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:23:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:23:48,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:23:48,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:23:48,638 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:23:48,770 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:23:48,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:23:49,030 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:23:49,138 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:23:49,138 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:23:49,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:23:49 BoogieIcfgContainer [2022-12-06 06:23:49,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:23:49,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:23:49,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:23:49,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:23:49,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:23:48" (1/3) ... [2022-12-06 06:23:49,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659947f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:23:49, skipping insertion in model container [2022-12-06 06:23:49,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:23:48" (2/3) ... [2022-12-06 06:23:49,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659947f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:23:49, skipping insertion in model container [2022-12-06 06:23:49,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:23:49" (3/3) ... [2022-12-06 06:23:49,148 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-12-06 06:23:49,161 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:23:49,161 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:23:49,161 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:23:49,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:23:49,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 06:23:49,285 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 06:23:49,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:23:49,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 06:23:49,291 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 06:23:49,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-06 06:23:49,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:49,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 06:23:49,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-06 06:23:49,340 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 06:23:49,340 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:23:49,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-06 06:23:49,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 06:23:49,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 2048 [2022-12-06 06:23:53,069 INFO L203 LiptonReduction]: Total number of compositions: 88 [2022-12-06 06:23:53,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:23:53,085 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;@59074770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:23:53,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:23:53,088 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 06:23:53,088 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:23:53,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:53,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:53,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -100198735, now seen corresponding path program 1 times [2022-12-06 06:23:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:53,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267478003] [2022-12-06 06:23:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:53,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:53,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267478003] [2022-12-06 06:23:53,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267478003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:53,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:53,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:23:53,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550332178] [2022-12-06 06:23:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:53,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:23:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:23:53,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:23:53,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:23:53,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:53,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:53,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:23:53,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:53,596 INFO L130 PetriNetUnfolder]: 994/1572 cut-off events. [2022-12-06 06:23:53,596 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:23:53,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1572 events. 994/1572 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7707 event pairs, 166 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3085. Up to 1189 conditions per place. [2022-12-06 06:23:53,604 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 26 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2022-12-06 06:23:53,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 141 flow [2022-12-06 06:23:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:23:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:23:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:23:53,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-06 06:23:53,613 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:23:53,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 141 flow [2022-12-06 06:23:53,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:23:53,616 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-06 06:23:53,617 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:23:53,619 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:23:53,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:53,620 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 52 flow [2022-12-06 06:23:53,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:53,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:53,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 52 flow [2022-12-06 06:23:53,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 06:23:53,626 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 06:23:53,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:23:53,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 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-06 06:23:53,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 06:23:53,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 06:23:53,833 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:23:53,836 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 06:23:53,836 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 06:23:53,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:53,836 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:53,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:53,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:23:53,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1801642657, now seen corresponding path program 1 times [2022-12-06 06:23:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:53,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521904484] [2022-12-06 06:23:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:54,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521904484] [2022-12-06 06:23:54,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521904484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:54,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:54,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:23:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820232395] [2022-12-06 06:23:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:54,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:23:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:54,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:23:54,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:23:54,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:23:54,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:54,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:23:54,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:54,229 INFO L130 PetriNetUnfolder]: 946/1467 cut-off events. [2022-12-06 06:23:54,229 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 06:23:54,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1467 events. 946/1467 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6505 event pairs, 302 based on Foata normal form. 42/1509 useless extension candidates. Maximal degree in co-relation 3066. Up to 1061 conditions per place. [2022-12-06 06:23:54,237 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-06 06:23:54,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 146 flow [2022-12-06 06:23:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:23:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:23:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:23:54,238 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 06:23:54,238 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:23:54,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 146 flow [2022-12-06 06:23:54,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:23:54,242 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 90 flow [2022-12-06 06:23:54,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 06:23:54,242 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-06 06:23:54,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:54,243 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 90 flow [2022-12-06 06:23:54,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:54,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:54,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 90 flow [2022-12-06 06:23:54,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 90 flow [2022-12-06 06:23:54,258 INFO L130 PetriNetUnfolder]: 48/153 cut-off events. [2022-12-06 06:23:54,258 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 06:23:54,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 153 events. 48/153 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 754 event pairs, 24 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 292. Up to 81 conditions per place. [2022-12-06 06:23:54,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 90 flow [2022-12-06 06:23:54,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 06:23:54,274 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:54,275 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 06:23:54,276 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 90 flow [2022-12-06 06:23:54,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:54,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:54,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:23:54,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash -16346648, now seen corresponding path program 1 times [2022-12-06 06:23:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:54,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437747984] [2022-12-06 06:23:54,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:54,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437747984] [2022-12-06 06:23:54,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437747984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:54,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:54,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:23:54,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657852306] [2022-12-06 06:23:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:54,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:23:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:54,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:23:54,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:23:54,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:23:54,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 90 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:54,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:23:54,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:54,562 INFO L130 PetriNetUnfolder]: 910/1413 cut-off events. [2022-12-06 06:23:54,563 INFO L131 PetriNetUnfolder]: For 579/579 co-relation queries the response was YES. [2022-12-06 06:23:54,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3675 conditions, 1413 events. 910/1413 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6095 event pairs, 178 based on Foata normal form. 12/1425 useless extension candidates. Maximal degree in co-relation 3663. Up to 867 conditions per place. [2022-12-06 06:23:54,568 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 32 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2022-12-06 06:23:54,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 212 flow [2022-12-06 06:23:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:23:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:23:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 06:23:54,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 06:23:54,569 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 90 flow. Second operand 4 states and 37 transitions. [2022-12-06 06:23:54,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 212 flow [2022-12-06 06:23:54,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:23:54,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 126 flow [2022-12-06 06:23:54,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-06 06:23:54,573 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-06 06:23:54,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:54,573 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 126 flow [2022-12-06 06:23:54,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:54,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:54,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 126 flow [2022-12-06 06:23:54,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 126 flow [2022-12-06 06:23:54,583 INFO L130 PetriNetUnfolder]: 39/136 cut-off events. [2022-12-06 06:23:54,583 INFO L131 PetriNetUnfolder]: For 66/77 co-relation queries the response was YES. [2022-12-06 06:23:54,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 136 events. 39/136 cut-off events. For 66/77 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 637 event pairs, 14 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 305. Up to 68 conditions per place. [2022-12-06 06:23:54,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 126 flow [2022-12-06 06:23:54,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 06:23:54,586 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:54,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 06:23:54,586 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 126 flow [2022-12-06 06:23:54,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:54,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:54,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:23:54,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:54,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -16346617, now seen corresponding path program 1 times [2022-12-06 06:23:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:54,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541910786] [2022-12-06 06:23:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:54,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:54,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541910786] [2022-12-06 06:23:54,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541910786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:54,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:54,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:23:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693797726] [2022-12-06 06:23:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:54,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:23:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:54,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:23:54,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:23:54,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:23:54,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 126 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:54,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:23:54,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:54,836 INFO L130 PetriNetUnfolder]: 878/1365 cut-off events. [2022-12-06 06:23:54,836 INFO L131 PetriNetUnfolder]: For 1033/1033 co-relation queries the response was YES. [2022-12-06 06:23:54,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3840 conditions, 1365 events. 878/1365 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5984 event pairs, 204 based on Foata normal form. 8/1373 useless extension candidates. Maximal degree in co-relation 3825. Up to 927 conditions per place. [2022-12-06 06:23:54,842 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 36 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2022-12-06 06:23:54,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 49 transitions, 294 flow [2022-12-06 06:23:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:23:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:23:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 06:23:54,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2022-12-06 06:23:54,843 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 126 flow. Second operand 4 states and 45 transitions. [2022-12-06 06:23:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 49 transitions, 294 flow [2022-12-06 06:23:54,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:23:54,846 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 195 flow [2022-12-06 06:23:54,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2022-12-06 06:23:54,846 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:23:54,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:54,846 INFO L89 Accepts]: Start accepts. Operand has 38 places, 31 transitions, 195 flow [2022-12-06 06:23:54,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:54,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:54,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 195 flow [2022-12-06 06:23:54,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 195 flow [2022-12-06 06:23:54,860 INFO L130 PetriNetUnfolder]: 33/122 cut-off events. [2022-12-06 06:23:54,860 INFO L131 PetriNetUnfolder]: For 154/171 co-relation queries the response was YES. [2022-12-06 06:23:54,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 122 events. 33/122 cut-off events. For 154/171 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 559 event pairs, 13 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 338. Up to 60 conditions per place. [2022-12-06 06:23:54,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 195 flow [2022-12-06 06:23:54,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:23:54,863 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:54,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:23:54,867 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 195 flow [2022-12-06 06:23:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,867 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:54,867 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:23:54,867 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -506745186, now seen corresponding path program 1 times [2022-12-06 06:23:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:54,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330229764] [2022-12-06 06:23:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330229764] [2022-12-06 06:23:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330229764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:54,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:54,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:23:54,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312167057] [2022-12-06 06:23:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:54,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:23:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:54,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:23:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:23:54,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:23:54,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:54,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:54,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:23:54,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:55,076 INFO L130 PetriNetUnfolder]: 429/743 cut-off events. [2022-12-06 06:23:55,076 INFO L131 PetriNetUnfolder]: For 1054/1091 co-relation queries the response was YES. [2022-12-06 06:23:55,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 743 events. 429/743 cut-off events. For 1054/1091 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3395 event pairs, 103 based on Foata normal form. 45/768 useless extension candidates. Maximal degree in co-relation 2288. Up to 602 conditions per place. [2022-12-06 06:23:55,079 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 39 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-12-06 06:23:55,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 377 flow [2022-12-06 06:23:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:23:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:23:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:23:55,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 06:23:55,080 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 195 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:23:55,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 377 flow [2022-12-06 06:23:55,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 375 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:23:55,083 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 219 flow [2022-12-06 06:23:55,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 06:23:55,084 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 06:23:55,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:55,084 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 219 flow [2022-12-06 06:23:55,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:55,084 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:55,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 219 flow [2022-12-06 06:23:55,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 219 flow [2022-12-06 06:23:55,133 INFO L130 PetriNetUnfolder]: 94/268 cut-off events. [2022-12-06 06:23:55,133 INFO L131 PetriNetUnfolder]: For 196/208 co-relation queries the response was YES. [2022-12-06 06:23:55,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 268 events. 94/268 cut-off events. For 196/208 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1541 event pairs, 42 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 669. Up to 133 conditions per place. [2022-12-06 06:23:55,135 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 219 flow [2022-12-06 06:23:55,135 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:23:55,136 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:55,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 06:23:55,136 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 219 flow [2022-12-06 06:23:55,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:55,137 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:55,137 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:55,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:23:55,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:55,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1339366383, now seen corresponding path program 1 times [2022-12-06 06:23:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:55,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630777565] [2022-12-06 06:23:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:55,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:55,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630777565] [2022-12-06 06:23:55,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630777565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:55,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:55,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:23:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820356040] [2022-12-06 06:23:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:55,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:23:55,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:23:55,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:23:55,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:23:55,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:55,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:55,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:23:55,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:55,312 INFO L130 PetriNetUnfolder]: 407/720 cut-off events. [2022-12-06 06:23:55,312 INFO L131 PetriNetUnfolder]: For 1151/1190 co-relation queries the response was YES. [2022-12-06 06:23:55,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 720 events. 407/720 cut-off events. For 1151/1190 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3310 event pairs, 146 based on Foata normal form. 24/735 useless extension candidates. Maximal degree in co-relation 2527. Up to 584 conditions per place. [2022-12-06 06:23:55,315 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2022-12-06 06:23:55,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 341 flow [2022-12-06 06:23:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:23:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:23:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-12-06 06:23:55,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2022-12-06 06:23:55,316 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 219 flow. Second operand 3 states and 33 transitions. [2022-12-06 06:23:55,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 341 flow [2022-12-06 06:23:55,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:23:55,319 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 235 flow [2022-12-06 06:23:55,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-06 06:23:55,319 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-06 06:23:55,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:55,319 INFO L89 Accepts]: Start accepts. Operand has 43 places, 34 transitions, 235 flow [2022-12-06 06:23:55,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:55,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:55,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 235 flow [2022-12-06 06:23:55,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 235 flow [2022-12-06 06:23:55,336 INFO L130 PetriNetUnfolder]: 87/251 cut-off events. [2022-12-06 06:23:55,337 INFO L131 PetriNetUnfolder]: For 244/253 co-relation queries the response was YES. [2022-12-06 06:23:55,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 251 events. 87/251 cut-off events. For 244/253 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1412 event pairs, 39 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 642. Up to 132 conditions per place. [2022-12-06 06:23:55,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 235 flow [2022-12-06 06:23:55,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:23:55,339 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:55,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:23:55,340 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 235 flow [2022-12-06 06:23:55,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:55,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:55,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:55,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:23:55,340 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 405883734, now seen corresponding path program 1 times [2022-12-06 06:23:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414801359] [2022-12-06 06:23:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414801359] [2022-12-06 06:23:55,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414801359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:55,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:55,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:23:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013604791] [2022-12-06 06:23:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:55,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:23:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:23:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:23:55,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:23:55,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:55,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:55,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:23:55,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:55,539 INFO L130 PetriNetUnfolder]: 212/410 cut-off events. [2022-12-06 06:23:55,539 INFO L131 PetriNetUnfolder]: For 740/765 co-relation queries the response was YES. [2022-12-06 06:23:55,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 410 events. 212/410 cut-off events. For 740/765 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1719 event pairs, 43 based on Foata normal form. 52/454 useless extension candidates. Maximal degree in co-relation 1505. Up to 149 conditions per place. [2022-12-06 06:23:55,541 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 49 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-06 06:23:55,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 526 flow [2022-12-06 06:23:55,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:23:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:23:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 06:23:55,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 06:23:55,543 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 235 flow. Second operand 4 states and 48 transitions. [2022-12-06 06:23:55,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 526 flow [2022-12-06 06:23:55,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 500 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:23:55,546 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 261 flow [2022-12-06 06:23:55,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-06 06:23:55,546 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2022-12-06 06:23:55,547 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:55,547 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 261 flow [2022-12-06 06:23:55,548 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:55,548 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:55,548 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 261 flow [2022-12-06 06:23:55,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 261 flow [2022-12-06 06:23:55,563 INFO L130 PetriNetUnfolder]: 44/155 cut-off events. [2022-12-06 06:23:55,563 INFO L131 PetriNetUnfolder]: For 184/207 co-relation queries the response was YES. [2022-12-06 06:23:55,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 155 events. 44/155 cut-off events. For 184/207 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 706 event pairs, 9 based on Foata normal form. 9/162 useless extension candidates. Maximal degree in co-relation 500. Up to 75 conditions per place. [2022-12-06 06:23:55,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 261 flow [2022-12-06 06:23:55,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 06:23:55,565 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:55,566 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 06:23:55,566 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 261 flow [2022-12-06 06:23:55,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:55,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:55,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:23:55,567 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1789073076, now seen corresponding path program 1 times [2022-12-06 06:23:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:55,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484973302] [2022-12-06 06:23:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:55,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:55,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:55,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484973302] [2022-12-06 06:23:55,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484973302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:55,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:55,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:23:55,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677985494] [2022-12-06 06:23:55,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:55,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:23:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:55,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:23:55,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:23:55,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:23:55,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:55,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:55,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:23:55,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:55,782 INFO L130 PetriNetUnfolder]: 172/324 cut-off events. [2022-12-06 06:23:55,782 INFO L131 PetriNetUnfolder]: For 717/751 co-relation queries the response was YES. [2022-12-06 06:23:55,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 324 events. 172/324 cut-off events. For 717/751 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1297 event pairs, 37 based on Foata normal form. 34/350 useless extension candidates. Maximal degree in co-relation 1315. Up to 132 conditions per place. [2022-12-06 06:23:55,784 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 45 selfloop transitions, 10 changer transitions 1/62 dead transitions. [2022-12-06 06:23:55,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 528 flow [2022-12-06 06:23:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:23:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:23:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 06:23:55,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 06:23:55,785 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 261 flow. Second operand 5 states and 50 transitions. [2022-12-06 06:23:55,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 528 flow [2022-12-06 06:23:55,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 06:23:55,788 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 261 flow [2022-12-06 06:23:55,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-06 06:23:55,788 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-06 06:23:55,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:55,788 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 261 flow [2022-12-06 06:23:55,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:55,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:55,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 261 flow [2022-12-06 06:23:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 261 flow [2022-12-06 06:23:55,798 INFO L130 PetriNetUnfolder]: 35/112 cut-off events. [2022-12-06 06:23:55,798 INFO L131 PetriNetUnfolder]: For 196/206 co-relation queries the response was YES. [2022-12-06 06:23:55,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 112 events. 35/112 cut-off events. For 196/206 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 431 event pairs, 4 based on Foata normal form. 1/111 useless extension candidates. Maximal degree in co-relation 380. Up to 36 conditions per place. [2022-12-06 06:23:55,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 261 flow [2022-12-06 06:23:55,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 06:23:56,103 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:23:56,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-06 06:23:56,106 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 257 flow [2022-12-06 06:23:56,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:56,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:56,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:56,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:23:56,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1955910610, now seen corresponding path program 1 times [2022-12-06 06:23:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:56,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832057310] [2022-12-06 06:23:56,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:56,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:56,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832057310] [2022-12-06 06:23:56,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832057310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:56,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:56,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:23:56,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742316330] [2022-12-06 06:23:56,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:56,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:23:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:23:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:23:56,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:23:56,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 257 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:56,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:56,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:23:56,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:56,405 INFO L130 PetriNetUnfolder]: 244/446 cut-off events. [2022-12-06 06:23:56,406 INFO L131 PetriNetUnfolder]: For 1220/1220 co-relation queries the response was YES. [2022-12-06 06:23:56,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 446 events. 244/446 cut-off events. For 1220/1220 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1816 event pairs, 31 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 1855. Up to 201 conditions per place. [2022-12-06 06:23:56,408 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 42 selfloop transitions, 18 changer transitions 10/70 dead transitions. [2022-12-06 06:23:56,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 605 flow [2022-12-06 06:23:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:23:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:23:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:23:56,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 06:23:56,409 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 257 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:23:56,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 605 flow [2022-12-06 06:23:56,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 549 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 06:23:56,413 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 361 flow [2022-12-06 06:23:56,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-06 06:23:56,413 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2022-12-06 06:23:56,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:56,413 INFO L89 Accepts]: Start accepts. Operand has 47 places, 43 transitions, 361 flow [2022-12-06 06:23:56,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:56,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:56,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 361 flow [2022-12-06 06:23:56,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 361 flow [2022-12-06 06:23:56,425 INFO L130 PetriNetUnfolder]: 49/150 cut-off events. [2022-12-06 06:23:56,425 INFO L131 PetriNetUnfolder]: For 304/322 co-relation queries the response was YES. [2022-12-06 06:23:56,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 150 events. 49/150 cut-off events. For 304/322 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 690 event pairs, 4 based on Foata normal form. 9/155 useless extension candidates. Maximal degree in co-relation 528. Up to 49 conditions per place. [2022-12-06 06:23:56,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 361 flow [2022-12-06 06:23:56,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:23:56,427 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:23:56,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 06:23:56,428 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 361 flow [2022-12-06 06:23:56,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:56,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:56,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:23:56,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2124178382, now seen corresponding path program 2 times [2022-12-06 06:23:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:56,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130677253] [2022-12-06 06:23:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:56,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:56,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130677253] [2022-12-06 06:23:56,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130677253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:56,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:23:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366030761] [2022-12-06 06:23:56,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:56,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:23:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:23:56,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:23:56,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:23:56,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 361 flow. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:56,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:56,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:23:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:56,667 INFO L130 PetriNetUnfolder]: 287/540 cut-off events. [2022-12-06 06:23:56,667 INFO L131 PetriNetUnfolder]: For 1911/1911 co-relation queries the response was YES. [2022-12-06 06:23:56,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 540 events. 287/540 cut-off events. For 1911/1911 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2406 event pairs, 40 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 2431. Up to 195 conditions per place. [2022-12-06 06:23:56,670 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 30 selfloop transitions, 8 changer transitions 45/83 dead transitions. [2022-12-06 06:23:56,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 749 flow [2022-12-06 06:23:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:23:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:23:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-06 06:23:56,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-06 06:23:56,671 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 361 flow. Second operand 6 states and 52 transitions. [2022-12-06 06:23:56,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 749 flow [2022-12-06 06:23:56,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 747 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:23:56,676 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 219 flow [2022-12-06 06:23:56,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2022-12-06 06:23:56,677 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-06 06:23:56,677 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:56,677 INFO L89 Accepts]: Start accepts. Operand has 53 places, 28 transitions, 219 flow [2022-12-06 06:23:56,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:56,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:56,678 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 28 transitions, 219 flow [2022-12-06 06:23:56,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 28 transitions, 219 flow [2022-12-06 06:23:56,700 INFO L130 PetriNetUnfolder]: 19/76 cut-off events. [2022-12-06 06:23:56,701 INFO L131 PetriNetUnfolder]: For 236/243 co-relation queries the response was YES. [2022-12-06 06:23:56,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 76 events. 19/76 cut-off events. For 236/243 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 2 based on Foata normal form. 5/79 useless extension candidates. Maximal degree in co-relation 278. Up to 20 conditions per place. [2022-12-06 06:23:56,701 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 28 transitions, 219 flow [2022-12-06 06:23:56,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-06 06:23:56,732 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:23:56,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:23:56,733 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 214 flow [2022-12-06 06:23:56,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:56,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:56,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:56,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:23:56,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1877984745, now seen corresponding path program 1 times [2022-12-06 06:23:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:56,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439629006] [2022-12-06 06:23:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:23:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:23:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:23:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439629006] [2022-12-06 06:23:56,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439629006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:23:56,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:23:56,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:23:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839815139] [2022-12-06 06:23:56,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:23:56,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:23:56,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:23:56,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:23:56,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:23:56,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:23:56,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 27 transitions, 214 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:56,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:23:56,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:23:56,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:23:56,898 INFO L130 PetriNetUnfolder]: 82/186 cut-off events. [2022-12-06 06:23:56,899 INFO L131 PetriNetUnfolder]: For 1029/1029 co-relation queries the response was YES. [2022-12-06 06:23:56,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 186 events. 82/186 cut-off events. For 1029/1029 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 723 event pairs, 19 based on Foata normal form. 1/187 useless extension candidates. Maximal degree in co-relation 880. Up to 93 conditions per place. [2022-12-06 06:23:56,900 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-06 06:23:56,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 39 transitions, 348 flow [2022-12-06 06:23:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:23:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:23:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-12-06 06:23:56,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-06 06:23:56,901 INFO L175 Difference]: Start difference. First operand has 51 places, 27 transitions, 214 flow. Second operand 4 states and 28 transitions. [2022-12-06 06:23:56,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 39 transitions, 348 flow [2022-12-06 06:23:56,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 290 flow, removed 4 selfloop flow, removed 12 redundant places. [2022-12-06 06:23:56,903 INFO L231 Difference]: Finished difference. Result has 43 places, 22 transitions, 132 flow [2022-12-06 06:23:56,903 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2022-12-06 06:23:56,903 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-06 06:23:56,903 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:23:56,903 INFO L89 Accepts]: Start accepts. Operand has 43 places, 22 transitions, 132 flow [2022-12-06 06:23:56,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:23:56,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:23:56,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 22 transitions, 132 flow [2022-12-06 06:23:56,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 22 transitions, 132 flow [2022-12-06 06:23:56,909 INFO L130 PetriNetUnfolder]: 6/32 cut-off events. [2022-12-06 06:23:56,909 INFO L131 PetriNetUnfolder]: For 66/69 co-relation queries the response was YES. [2022-12-06 06:23:56,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 32 events. 6/32 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 2/33 useless extension candidates. Maximal degree in co-relation 96. Up to 10 conditions per place. [2022-12-06 06:23:56,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 22 transitions, 132 flow [2022-12-06 06:23:56,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 32 [2022-12-06 06:23:57,378 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:23:57,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 476 [2022-12-06 06:23:57,379 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 20 transitions, 124 flow [2022-12-06 06:23:57,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:23:57,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:23:57,380 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:57,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:23:57,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:23:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:23:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1327468857, now seen corresponding path program 1 times [2022-12-06 06:23:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:23:57,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511319575] [2022-12-06 06:23:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:23:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:23:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:23:57,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:23:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:23:57,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:23:57,480 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:23:57,481 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:23:57,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:23:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:23:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:23:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:23:57,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:23:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:23:57,483 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:23:57,487 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:23:57,487 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:23:57,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:23:57 BasicIcfg [2022-12-06 06:23:57,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:23:57,549 INFO L158 Benchmark]: Toolchain (without parser) took 9498.73ms. Allocated memory was 202.4MB in the beginning and 383.8MB in the end (delta: 181.4MB). Free memory was 176.9MB in the beginning and 289.5MB in the end (delta: -112.5MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2022-12-06 06:23:57,549 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory is still 179.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:23:57,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.92ms. Allocated memory is still 202.4MB. Free memory was 176.4MB in the beginning and 150.1MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:23:57,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.47ms. Allocated memory is still 202.4MB. Free memory was 150.1MB in the beginning and 147.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:23:57,550 INFO L158 Benchmark]: Boogie Preprocessor took 20.52ms. Allocated memory is still 202.4MB. Free memory was 147.6MB in the beginning and 146.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:23:57,550 INFO L158 Benchmark]: RCFGBuilder took 563.62ms. Allocated memory is still 202.4MB. Free memory was 146.0MB in the beginning and 116.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:23:57,550 INFO L158 Benchmark]: TraceAbstraction took 8406.98ms. Allocated memory was 202.4MB in the beginning and 383.8MB in the end (delta: 181.4MB). Free memory was 115.0MB in the beginning and 289.5MB in the end (delta: -174.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-12-06 06:23:57,554 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory is still 179.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.92ms. Allocated memory is still 202.4MB. Free memory was 176.4MB in the beginning and 150.1MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.47ms. Allocated memory is still 202.4MB. Free memory was 150.1MB in the beginning and 147.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.52ms. Allocated memory is still 202.4MB. Free memory was 147.6MB in the beginning and 146.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 563.62ms. Allocated memory is still 202.4MB. Free memory was 146.0MB in the beginning and 116.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 8406.98ms. Allocated memory was 202.4MB in the beginning and 383.8MB in the end (delta: 181.4MB). Free memory was 115.0MB in the beginning and 289.5MB in the end (delta: -174.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 119 PlacesBefore, 35 PlacesAfterwards, 111 TransitionsBefore, 26 TransitionsAfterwards, 2048 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 44 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1479, independent: 1422, independent conditional: 1422, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1479, independent: 1422, independent conditional: 0, independent unconditional: 1422, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1479, independent: 1422, independent conditional: 0, independent unconditional: 1422, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1479, independent: 1422, independent conditional: 0, independent unconditional: 1422, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1198, independent: 1156, independent conditional: 0, independent unconditional: 1156, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1198, independent: 1141, independent conditional: 0, independent unconditional: 1141, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1479, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1198, unknown conditional: 0, unknown unconditional: 1198] , Statistics on independence cache: Total cache size (in pairs): 1988, Positive cache size: 1946, Positive conditional cache size: 0, Positive unconditional cache size: 1946, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 239, independent: 201, independent conditional: 201, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 239, independent: 201, independent conditional: 11, independent unconditional: 190, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, independent: 201, independent conditional: 11, independent unconditional: 190, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, independent: 201, independent conditional: 11, independent unconditional: 190, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 140, independent: 118, independent conditional: 11, independent unconditional: 107, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 82, dependent conditional: 14, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 239, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 140, unknown conditional: 14, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 123, Positive conditional cache size: 11, Positive unconditional cache size: 112, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 67, independent conditional: 12, independent unconditional: 55, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 128, Positive conditional cache size: 11, Positive unconditional cache size: 117, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, independent: 95, independent conditional: 95, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 109, independent: 95, independent conditional: 18, independent unconditional: 77, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 11, Positive unconditional cache size: 119, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 101, independent conditional: 101, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 117, independent: 101, independent conditional: 19, independent unconditional: 82, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 11, Positive unconditional cache size: 119, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 48, independent conditional: 12, independent unconditional: 36, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 48, independent conditional: 4, independent unconditional: 44, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 11, Positive unconditional cache size: 119, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 60, independent conditional: 16, independent unconditional: 44, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 60, independent conditional: 7, independent unconditional: 53, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 60, independent conditional: 7, independent unconditional: 53, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 60, independent conditional: 7, independent unconditional: 53, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 11, Positive unconditional cache size: 119, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 16, independent unconditional: 50, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 11, Positive unconditional cache size: 119, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 46 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 152, independent conditional: 152, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 152, independent conditional: 72, independent unconditional: 80, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 152, independent conditional: 32, independent unconditional: 120, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 152, independent conditional: 32, independent unconditional: 120, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, independent: 152, independent conditional: 32, independent unconditional: 120, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 140, Positive conditional cache size: 11, Positive unconditional cache size: 129, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 140, Positive conditional cache size: 11, Positive unconditional cache size: 129, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 51 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 16, independent unconditional: 10, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 182, Positive conditional cache size: 13, Positive unconditional cache size: 169, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 43 PlacesBefore, 41 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 23, independent conditional: 8, independent unconditional: 15, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 23, independent conditional: 8, independent unconditional: 15, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 22, independent conditional: 8, independent unconditional: 14, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 189, Positive conditional cache size: 13, Positive unconditional cache size: 176, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-1, t876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=0, t876={5:0}, t877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=1, t876={5:0}, t877={6:0}, t878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 143 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: 8.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 14 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:23:57,589 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...