/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:35:14,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:35:14,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:35:14,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:35:14,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:35:14,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:35:14,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:35:14,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:35:14,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:35:14,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:35:14,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:35:14,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:35:14,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:35:14,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:35:14,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:35:14,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:35:14,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:35:14,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:35:14,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:35:14,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:35:14,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:35:14,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:35:14,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:35:14,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:35:14,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:35:14,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:35:14,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:35:14,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:35:14,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:35:14,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:35:14,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:35:14,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:35:14,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:35:14,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:35:14,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:35:14,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:35:14,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:35:14,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:35:14,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:35:14,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:35:14,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:35:14,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:35:14,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:35:14,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:35:14,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:35:14,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:35:14,462 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:35:14,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:35:14,463 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:35:14,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:35:14,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:35:14,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:35:14,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:35:14,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:35:14,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:35:14,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:35:14,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:35:14,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:35:14,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:35:14,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:35:14,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:35:14,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:35:14,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:35:14,466 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:35:14,466 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 04:35:14,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:35:14,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:35:14,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:35:14,787 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:35:14,787 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:35:14,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:35:15,848 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:35:16,076 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:35:16,087 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:35:16,102 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd8ce40a/2264d4f1fb8b4c468f0c4d33b9817a68/FLAG0e6475b66 [2022-12-06 04:35:16,114 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd8ce40a/2264d4f1fb8b4c468f0c4d33b9817a68 [2022-12-06 04:35:16,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:35:16,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:35:16,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:35:16,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:35:16,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:35:16,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b60af17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16, skipping insertion in model container [2022-12-06 04:35:16,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:35:16,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:35:16,301 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 04:35:16,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:35:16,497 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:35:16,508 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 04:35:16,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:16,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:16,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:35:16,578 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:35:16,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16 WrapperNode [2022-12-06 04:35:16,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:35:16,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:35:16,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:35:16,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:35:16,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,635 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 04:35:16,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:35:16,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:35:16,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:35:16,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:35:16,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:35:16,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:35:16,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:35:16,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:35:16,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (1/1) ... [2022-12-06 04:35:16,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:35:16,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:35:16,721 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 04:35:16,735 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 04:35:16,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:35:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:35:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:35:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:35:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:35:16,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:35:16,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:35:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:35:16,766 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 04:35:16,923 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:35:16,925 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:35:17,089 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:35:17,193 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:35:17,193 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:35:17,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:17 BoogieIcfgContainer [2022-12-06 04:35:17,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:35:17,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:35:17,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:35:17,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:35:17,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:35:16" (1/3) ... [2022-12-06 04:35:17,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730d6606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:35:17, skipping insertion in model container [2022-12-06 04:35:17,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:16" (2/3) ... [2022-12-06 04:35:17,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730d6606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:35:17, skipping insertion in model container [2022-12-06 04:35:17,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:17" (3/3) ... [2022-12-06 04:35:17,203 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 04:35:17,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:35:17,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:35:17,221 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:35:17,281 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:35:17,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 04:35:17,395 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 04:35:17,396 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:17,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:35:17,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 04:35:17,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-06 04:35:17,406 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:17,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-06 04:35:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-06 04:35:17,447 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 04:35:17,449 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:17,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:35:17,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-06 04:35:17,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 1676 [2022-12-06 04:35:20,963 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 04:35:20,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:35:20,983 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;@207987aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:35:20,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:35:20,990 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 04:35:20,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:20,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:20,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:20,992 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 04:35:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash -580746594, now seen corresponding path program 1 times [2022-12-06 04:35:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895414326] [2022-12-06 04:35:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:21,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:21,298 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 04:35:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:21,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895414326] [2022-12-06 04:35:21,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895414326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:21,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:21,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:35:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345895516] [2022-12-06 04:35:21,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:21,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:21,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:21,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:21,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 04:35:21,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 04:35:21,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:21,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 04:35:21,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:21,552 INFO L130 PetriNetUnfolder]: 615/1020 cut-off events. [2022-12-06 04:35:21,552 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:35:21,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 1020 events. 615/1020 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5095 event pairs, 129 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1980. Up to 703 conditions per place. [2022-12-06 04:35:21,565 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 04:35:21,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-06 04:35:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:35:21,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 04:35:21,579 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:35:21,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-06 04:35:21,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:21,584 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 04:35:21,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 04:35:21,591 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 04:35:21,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:21,592 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 04:35:21,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:21,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:21,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 04:35:21,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 04:35:21,608 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 04:35:21,608 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:21,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:35:21,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 04:35:21,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 04:35:21,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:21,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 04:35:21,716 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 04:35:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 04:35:21,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:21,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:21,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:35:21,720 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 04:35:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash 248248355, now seen corresponding path program 1 times [2022-12-06 04:35:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:21,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099916668] [2022-12-06 04:35:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:21,951 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 04:35:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:21,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099916668] [2022-12-06 04:35:21,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099916668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:21,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:21,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:35:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041657156] [2022-12-06 04:35:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:21,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:35:21,954 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 04:35:21,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:21,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:35:21,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:22,139 INFO L130 PetriNetUnfolder]: 951/1470 cut-off events. [2022-12-06 04:35:22,139 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 04:35:22,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1470 events. 951/1470 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6754 event pairs, 319 based on Foata normal form. 52/1522 useless extension candidates. Maximal degree in co-relation 3038. Up to 1018 conditions per place. [2022-12-06 04:35:22,149 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 30 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-06 04:35:22,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 156 flow [2022-12-06 04:35:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:35:22,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 04:35:22,150 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:35:22,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 156 flow [2022-12-06 04:35:22,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:22,152 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 82 flow [2022-12-06 04:35:22,152 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=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-06 04:35:22,153 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-06 04:35:22,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:22,153 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 82 flow [2022-12-06 04:35:22,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:22,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:22,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 82 flow [2022-12-06 04:35:22,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 82 flow [2022-12-06 04:35:22,163 INFO L130 PetriNetUnfolder]: 24/99 cut-off events. [2022-12-06 04:35:22,163 INFO L131 PetriNetUnfolder]: For 14/18 co-relation queries the response was YES. [2022-12-06 04:35:22,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 99 events. 24/99 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 441 event pairs, 12 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 180. Up to 45 conditions per place. [2022-12-06 04:35:22,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 82 flow [2022-12-06 04:35:22,164 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 04:35:22,202 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:22,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:35:22,204 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 82 flow [2022-12-06 04:35:22,204 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 04:35:22,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:22,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:22,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:35:22,205 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 04:35:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2022-12-06 04:35:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:22,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156491685] [2022-12-06 04:35:22,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:22,387 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 04:35:22,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:22,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156491685] [2022-12-06 04:35:22,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156491685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:22,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:22,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31629311] [2022-12-06 04:35:22,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:22,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:35:22,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:35:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:35:22,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:35:22,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 04:35:22,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:22,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:35:22,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:22,599 INFO L130 PetriNetUnfolder]: 575/996 cut-off events. [2022-12-06 04:35:22,599 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-06 04:35:22,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 996 events. 575/996 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5035 event pairs, 110 based on Foata normal form. 96/1063 useless extension candidates. Maximal degree in co-relation 2378. Up to 625 conditions per place. [2022-12-06 04:35:22,604 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 43 selfloop transitions, 8 changer transitions 3/58 dead transitions. [2022-12-06 04:35:22,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 300 flow [2022-12-06 04:35:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:35:22,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6105263157894737 [2022-12-06 04:35:22,606 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 82 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:35:22,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 300 flow [2022-12-06 04:35:22,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:22,609 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 132 flow [2022-12-06 04:35:22,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-12-06 04:35:22,609 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 04:35:22,609 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:22,610 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 132 flow [2022-12-06 04:35:22,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:22,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:22,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 132 flow [2022-12-06 04:35:22,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 132 flow [2022-12-06 04:35:22,630 INFO L130 PetriNetUnfolder]: 114/286 cut-off events. [2022-12-06 04:35:22,630 INFO L131 PetriNetUnfolder]: For 142/220 co-relation queries the response was YES. [2022-12-06 04:35:22,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 286 events. 114/286 cut-off events. For 142/220 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1714 event pairs, 44 based on Foata normal form. 5/260 useless extension candidates. Maximal degree in co-relation 724. Up to 158 conditions per place. [2022-12-06 04:35:22,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 132 flow [2022-12-06 04:35:22,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 04:35:22,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:22,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 04:35:22,673 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 126 flow [2022-12-06 04:35:22,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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 04:35:22,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:22,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:22,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:35:22,673 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 04:35:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:22,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1158460356, now seen corresponding path program 1 times [2022-12-06 04:35:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:22,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929943936] [2022-12-06 04:35:22,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:22,794 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 04:35:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:22,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929943936] [2022-12-06 04:35:22,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929943936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:22,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:22,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:35:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876220746] [2022-12-06 04:35:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:22,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:22,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:22,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:35:22,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 04:35:22,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:22,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:35:22,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:22,938 INFO L130 PetriNetUnfolder]: 276/529 cut-off events. [2022-12-06 04:35:22,938 INFO L131 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2022-12-06 04:35:22,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 529 events. 276/529 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2438 event pairs, 46 based on Foata normal form. 61/576 useless extension candidates. Maximal degree in co-relation 1635. Up to 228 conditions per place. [2022-12-06 04:35:22,941 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 42 selfloop transitions, 11 changer transitions 13/70 dead transitions. [2022-12-06 04:35:22,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 70 transitions, 404 flow [2022-12-06 04:35:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:35:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:35:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 04:35:22,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2022-12-06 04:35:22,942 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 126 flow. Second operand 6 states and 70 transitions. [2022-12-06 04:35:22,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 70 transitions, 404 flow [2022-12-06 04:35:22,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 70 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:22,945 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 190 flow [2022-12-06 04:35:22,945 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 04:35:22,946 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 04:35:22,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:22,946 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 190 flow [2022-12-06 04:35:22,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:22,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:22,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 190 flow [2022-12-06 04:35:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 190 flow [2022-12-06 04:35:22,961 INFO L130 PetriNetUnfolder]: 49/162 cut-off events. [2022-12-06 04:35:22,961 INFO L131 PetriNetUnfolder]: For 261/339 co-relation queries the response was YES. [2022-12-06 04:35:22,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 162 events. 49/162 cut-off events. For 261/339 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 821 event pairs, 8 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 546. Up to 99 conditions per place. [2022-12-06 04:35:22,962 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 190 flow [2022-12-06 04:35:22,962 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 04:35:22,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:22,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-06 04:35:22,994 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 182 flow [2022-12-06 04:35:22,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 04:35:22,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:22,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:22,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:35:22,995 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 04:35:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash 956565081, now seen corresponding path program 1 times [2022-12-06 04:35:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:22,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010046299] [2022-12-06 04:35:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:23,122 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 04:35:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010046299] [2022-12-06 04:35:23,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010046299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:23,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:23,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291979593] [2022-12-06 04:35:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:23,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:35:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:35:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:35:23,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:35:23,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 182 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 04:35:23,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:23,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:35:23,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:23,244 INFO L130 PetriNetUnfolder]: 306/583 cut-off events. [2022-12-06 04:35:23,244 INFO L131 PetriNetUnfolder]: For 836/836 co-relation queries the response was YES. [2022-12-06 04:35:23,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 583 events. 306/583 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2612 event pairs, 5 based on Foata normal form. 8/591 useless extension candidates. Maximal degree in co-relation 2038. Up to 263 conditions per place. [2022-12-06 04:35:23,246 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 63 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2022-12-06 04:35:23,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 75 transitions, 550 flow [2022-12-06 04:35:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 04:35:23,248 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6105263157894737 [2022-12-06 04:35:23,248 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 182 flow. Second operand 5 states and 58 transitions. [2022-12-06 04:35:23,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 75 transitions, 550 flow [2022-12-06 04:35:23,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 75 transitions, 483 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:23,251 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 207 flow [2022-12-06 04:35:23,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 04:35:23,252 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 04:35:23,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:23,252 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 207 flow [2022-12-06 04:35:23,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:23,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:23,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 207 flow [2022-12-06 04:35:23,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 207 flow [2022-12-06 04:35:23,268 INFO L130 PetriNetUnfolder]: 58/189 cut-off events. [2022-12-06 04:35:23,268 INFO L131 PetriNetUnfolder]: For 191/232 co-relation queries the response was YES. [2022-12-06 04:35:23,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 189 events. 58/189 cut-off events. For 191/232 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 915 event pairs, 6 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 562. Up to 69 conditions per place. [2022-12-06 04:35:23,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 207 flow [2022-12-06 04:35:23,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 04:35:23,271 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:23,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:35:23,271 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 207 flow [2022-12-06 04:35:23,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 04:35:23,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:23,272 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:23,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:35:23,272 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 04:35:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -106285999, now seen corresponding path program 2 times [2022-12-06 04:35:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:23,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842490278] [2022-12-06 04:35:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:23,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842490278] [2022-12-06 04:35:23,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842490278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:23,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:23,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:35:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882368069] [2022-12-06 04:35:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:23,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:35:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:23,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:35:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:35:23,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 04:35:23,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:23,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:23,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 04:35:23,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:23,535 INFO L130 PetriNetUnfolder]: 215/427 cut-off events. [2022-12-06 04:35:23,535 INFO L131 PetriNetUnfolder]: For 703/710 co-relation queries the response was YES. [2022-12-06 04:35:23,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 427 events. 215/427 cut-off events. For 703/710 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1930 event pairs, 32 based on Foata normal form. 26/441 useless extension candidates. Maximal degree in co-relation 1568. Up to 157 conditions per place. [2022-12-06 04:35:23,537 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 36 selfloop transitions, 10 changer transitions 20/74 dead transitions. [2022-12-06 04:35:23,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 541 flow [2022-12-06 04:35:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:35:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:35:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 04:35:23,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2022-12-06 04:35:23,538 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 207 flow. Second operand 7 states and 64 transitions. [2022-12-06 04:35:23,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 541 flow [2022-12-06 04:35:23,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 529 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 04:35:23,541 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 229 flow [2022-12-06 04:35:23,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-06 04:35:23,542 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 04:35:23,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:23,542 INFO L89 Accepts]: Start accepts. Operand has 50 places, 35 transitions, 229 flow [2022-12-06 04:35:23,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:23,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:23,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 229 flow [2022-12-06 04:35:23,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 229 flow [2022-12-06 04:35:23,553 INFO L130 PetriNetUnfolder]: 35/118 cut-off events. [2022-12-06 04:35:23,553 INFO L131 PetriNetUnfolder]: For 184/225 co-relation queries the response was YES. [2022-12-06 04:35:23,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 118 events. 35/118 cut-off events. For 184/225 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 492 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 418. Up to 40 conditions per place. [2022-12-06 04:35:23,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 229 flow [2022-12-06 04:35:23,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:35:23,823 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:35:23,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-06 04:35:23,824 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 225 flow [2022-12-06 04:35:23,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:23,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:23,824 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 04:35:23,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:35:23,824 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 04:35:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -875636791, now seen corresponding path program 1 times [2022-12-06 04:35:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:23,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941089305] [2022-12-06 04:35:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:23,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941089305] [2022-12-06 04:35:23,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941089305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:23,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:23,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:35:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309187462] [2022-12-06 04:35:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:23,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:23,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 04:35:23,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:23,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:23,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 04:35:23,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:24,082 INFO L130 PetriNetUnfolder]: 236/472 cut-off events. [2022-12-06 04:35:24,082 INFO L131 PetriNetUnfolder]: For 1235/1244 co-relation queries the response was YES. [2022-12-06 04:35:24,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 472 events. 236/472 cut-off events. For 1235/1244 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2258 event pairs, 93 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 1958. Up to 261 conditions per place. [2022-12-06 04:35:24,085 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 25 selfloop transitions, 3 changer transitions 20/50 dead transitions. [2022-12-06 04:35:24,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 442 flow [2022-12-06 04:35:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 04:35:24,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 04:35:24,086 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 225 flow. Second operand 3 states and 27 transitions. [2022-12-06 04:35:24,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 442 flow [2022-12-06 04:35:24,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 379 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 04:35:24,091 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 158 flow [2022-12-06 04:35:24,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 04:35:24,092 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 04:35:24,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:24,092 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 158 flow [2022-12-06 04:35:24,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:24,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:24,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 158 flow [2022-12-06 04:35:24,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 158 flow [2022-12-06 04:35:24,100 INFO L130 PetriNetUnfolder]: 13/47 cut-off events. [2022-12-06 04:35:24,100 INFO L131 PetriNetUnfolder]: For 57/60 co-relation queries the response was YES. [2022-12-06 04:35:24,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 47 events. 13/47 cut-off events. For 57/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 132. Up to 16 conditions per place. [2022-12-06 04:35:24,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 158 flow [2022-12-06 04:35:24,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 04:35:24,235 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:35:24,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-06 04:35:24,236 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 162 flow [2022-12-06 04:35:24,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:35:24,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:24,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:24,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:35:24,237 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 04:35:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1878843346, now seen corresponding path program 1 times [2022-12-06 04:35:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:24,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911865840] [2022-12-06 04:35:24,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:24,619 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 04:35:24,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911865840] [2022-12-06 04:35:24,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911865840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:24,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:24,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:35:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815206503] [2022-12-06 04:35:24,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:24,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:35:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:35:24,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:35:24,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 04:35:24,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 04:35:24,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:24,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 04:35:24,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:24,737 INFO L130 PetriNetUnfolder]: 64/147 cut-off events. [2022-12-06 04:35:24,737 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-06 04:35:24,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 147 events. 64/147 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 533 event pairs, 8 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 557. Up to 47 conditions per place. [2022-12-06 04:35:24,739 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 5 changer transitions 17/49 dead transitions. [2022-12-06 04:35:24,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 402 flow [2022-12-06 04:35:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:35:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:35:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-06 04:35:24,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3425925925925926 [2022-12-06 04:35:24,740 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 162 flow. Second operand 6 states and 37 transitions. [2022-12-06 04:35:24,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 402 flow [2022-12-06 04:35:24,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 349 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 04:35:24,742 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 151 flow [2022-12-06 04:35:24,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 04:35:24,742 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 04:35:24,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:24,743 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 151 flow [2022-12-06 04:35:24,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:24,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:24,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 151 flow [2022-12-06 04:35:24,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 151 flow [2022-12-06 04:35:24,748 INFO L130 PetriNetUnfolder]: 14/52 cut-off events. [2022-12-06 04:35:24,748 INFO L131 PetriNetUnfolder]: For 53/54 co-relation queries the response was YES. [2022-12-06 04:35:24,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 52 events. 14/52 cut-off events. For 53/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 146. Up to 18 conditions per place. [2022-12-06 04:35:24,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 151 flow [2022-12-06 04:35:24,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 04:35:24,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:24,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-06 04:35:24,901 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 153 flow [2022-12-06 04:35:24,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 04:35:24,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:24,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:24,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:35:24,902 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 04:35:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash -470200895, now seen corresponding path program 1 times [2022-12-06 04:35:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:24,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801860076] [2022-12-06 04:35:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:25,041 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 04:35:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:25,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801860076] [2022-12-06 04:35:25,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801860076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:25,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:25,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:25,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508885015] [2022-12-06 04:35:25,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:35:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:25,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:35:25,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:35:25,042 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:35:25,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 153 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 04:35:25,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:25,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:35:25,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:25,097 INFO L130 PetriNetUnfolder]: 55/137 cut-off events. [2022-12-06 04:35:25,097 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-06 04:35:25,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 137 events. 55/137 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 12 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 514. Up to 59 conditions per place. [2022-12-06 04:35:25,098 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 21 selfloop transitions, 1 changer transitions 23/45 dead transitions. [2022-12-06 04:35:25,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 338 flow [2022-12-06 04:35:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:35:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:35:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 04:35:25,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-06 04:35:25,099 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 153 flow. Second operand 4 states and 31 transitions. [2022-12-06 04:35:25,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 338 flow [2022-12-06 04:35:25,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 324 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 04:35:25,100 INFO L231 Difference]: Finished difference. Result has 42 places, 21 transitions, 112 flow [2022-12-06 04:35:25,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=21} [2022-12-06 04:35:25,101 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 04:35:25,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:25,101 INFO L89 Accepts]: Start accepts. Operand has 42 places, 21 transitions, 112 flow [2022-12-06 04:35:25,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:25,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:25,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 21 transitions, 112 flow [2022-12-06 04:35:25,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 112 flow [2022-12-06 04:35:25,105 INFO L130 PetriNetUnfolder]: 5/24 cut-off events. [2022-12-06 04:35:25,105 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-06 04:35:25,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 24 events. 5/24 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2022-12-06 04:35:25,106 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 112 flow [2022-12-06 04:35:25,106 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 04:35:25,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] $Ultimate##0-->L803: Formula: (and (= v_~y$r_buff0_thd0~0_140 v_~y$r_buff1_thd0~0_147) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_307) (= v_~z~0_74 1) (= v_~y$w_buff0~0_209 1) (= |v_P2Thread1of1ForFork0_~arg#1.offset_23| |v_P2Thread1of1ForFork0_#in~arg#1.offset_23|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|) (= v_~y$r_buff0_thd3~0_155 v_~y$r_buff1_thd3~0_121) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_210) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_23| |v_P2Thread1of1ForFork0_~arg#1.base_23|) (= v_~y$r_buff0_thd3~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_307 256) 0)) (not (= (mod v_~y$w_buff0_used~0_344 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_344 1) (= v_~y$r_buff0_thd1~0_45 v_~y$r_buff1_thd1~0_51) (= v_~y$r_buff0_thd2~0_151 v_~y$r_buff1_thd2~0_160) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_210, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_171, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_154, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_209, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_23|, ~z~0=v_~z~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_307} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [432] $Ultimate##0-->P0EXIT: Formula: (and (= v_~z~0_82 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= |v_P0Thread1of1ForFork1_#res.offset_19| 0) (= v_~__unbuffered_cnt~0_167 (+ v_~__unbuffered_cnt~0_168 1)) (= |v_P0Thread1of1ForFork1_#res.base_19| 0) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~x~0_49 v_~__unbuffered_p0_EAX~0_60)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_168, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x~0=v_~x~0_49} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_19|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_167, ~z~0=v_~z~0_82, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:35:26,091 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] $Ultimate##0-->L803: Formula: (and (= v_~y$r_buff0_thd0~0_140 v_~y$r_buff1_thd0~0_147) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_307) (= v_~z~0_74 1) (= v_~y$w_buff0~0_209 1) (= |v_P2Thread1of1ForFork0_~arg#1.offset_23| |v_P2Thread1of1ForFork0_#in~arg#1.offset_23|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|) (= v_~y$r_buff0_thd3~0_155 v_~y$r_buff1_thd3~0_121) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_210) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_23| |v_P2Thread1of1ForFork0_~arg#1.base_23|) (= v_~y$r_buff0_thd3~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_307 256) 0)) (not (= (mod v_~y$w_buff0_used~0_344 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_344 1) (= v_~y$r_buff0_thd1~0_45 v_~y$r_buff1_thd1~0_51) (= v_~y$r_buff0_thd2~0_151 v_~y$r_buff1_thd2~0_160) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_210, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_171, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_154, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_209, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_23|, ~z~0=v_~z~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_307} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [429] $Ultimate##0-->L749: Formula: (and (= v_~x~0_45 v_~__unbuffered_p0_EAX~0_58) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z~0_78 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_45} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~z~0=v_~z~0_78, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_45, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:35:26,197 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:35:26,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1097 [2022-12-06 04:35:26,198 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 126 flow [2022-12-06 04:35:26,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 04:35:26,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:26,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:26,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:35:26,199 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 04:35:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1482647681, now seen corresponding path program 1 times [2022-12-06 04:35:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:26,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47875911] [2022-12-06 04:35:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:35:26,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:35:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:35:26,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:35:26,266 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:35:26,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:35:26,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:35:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:35:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:35:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:35:26,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:35:26,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:35:26,270 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:26,274 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:35:26,274 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:35:26,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:35:26 BasicIcfg [2022-12-06 04:35:26,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:35:26,320 INFO L158 Benchmark]: Toolchain (without parser) took 10203.24ms. Allocated memory was 176.2MB in the beginning and 397.4MB in the end (delta: 221.2MB). Free memory was 151.2MB in the beginning and 294.7MB in the end (delta: -143.5MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2022-12-06 04:35:26,320 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:35:26,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.48ms. Allocated memory is still 176.2MB. Free memory was 151.2MB in the beginning and 125.2MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:35:26,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.87ms. Allocated memory is still 176.2MB. Free memory was 125.2MB in the beginning and 122.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:35:26,320 INFO L158 Benchmark]: Boogie Preprocessor took 37.85ms. Allocated memory is still 176.2MB. Free memory was 122.6MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:35:26,321 INFO L158 Benchmark]: RCFGBuilder took 520.90ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 90.6MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 04:35:26,321 INFO L158 Benchmark]: TraceAbstraction took 9121.95ms. Allocated memory was 176.2MB in the beginning and 397.4MB in the end (delta: 221.2MB). Free memory was 90.1MB in the beginning and 294.7MB in the end (delta: -204.6MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2022-12-06 04:35:26,322 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.10ms. Allocated memory is still 176.2MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.48ms. Allocated memory is still 176.2MB. Free memory was 151.2MB in the beginning and 125.2MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.87ms. Allocated memory is still 176.2MB. Free memory was 125.2MB in the beginning and 122.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.85ms. Allocated memory is still 176.2MB. Free memory was 122.6MB in the beginning and 121.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.90ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 90.6MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9121.95ms. Allocated memory was 176.2MB in the beginning and 397.4MB in the end (delta: 221.2MB). Free memory was 90.1MB in the beginning and 294.7MB in the end (delta: -204.6MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 1457, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1112, independent: 1083, independent conditional: 0, independent unconditional: 1083, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1112, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 199, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1500, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1112, unknown conditional: 0, unknown unconditional: 1112] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1877, Positive conditional cache size: 0, Positive unconditional cache size: 1877, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 142, independent conditional: 18, independent unconditional: 124, dependent: 37, dependent conditional: 6, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 142, independent conditional: 18, independent unconditional: 124, dependent: 37, dependent conditional: 6, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 142, independent conditional: 18, independent unconditional: 124, dependent: 37, dependent conditional: 6, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 88, independent: 70, independent conditional: 8, independent unconditional: 62, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 88, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 67, dependent conditional: 17, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 72, independent conditional: 10, independent unconditional: 62, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 88, unknown conditional: 10, unknown unconditional: 78] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 9, Positive unconditional cache size: 66, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, 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, 23 TransitionsBefore, 23 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 92, Positive conditional cache size: 9, Positive unconditional cache size: 83, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 99, independent conditional: 99, 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: 117, independent: 99, independent conditional: 39, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 99, independent conditional: 39, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 99, independent conditional: 39, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 5, independent unconditional: 3, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 91, independent conditional: 34, independent unconditional: 57, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 100, Positive conditional cache size: 14, Positive unconditional cache size: 86, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 98, independent conditional: 26, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 98, independent conditional: 26, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 98, independent conditional: 26, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 118, independent: 93, independent conditional: 23, independent unconditional: 70, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 105, Positive conditional cache size: 17, Positive unconditional cache size: 88, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 50, independent unconditional: 30, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 90, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 105, Positive conditional cache size: 17, Positive unconditional cache size: 88, Negative cache size: 22, Negative conditional cache size: 2, 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.3s, 48 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 110, independent conditional: 66, independent unconditional: 44, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 132, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 109, Positive conditional cache size: 17, Positive unconditional cache size: 92, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 51, independent conditional: 40, independent unconditional: 11, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 51, independent conditional: 21, independent unconditional: 30, 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: 63, independent: 51, independent conditional: 21, independent unconditional: 30, 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 49, independent conditional: 19, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 145, Positive conditional cache size: 23, Positive unconditional cache size: 122, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 145, Positive conditional cache size: 23, Positive unconditional cache size: 122, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 38 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 206, Positive conditional cache size: 24, Positive unconditional cache size: 182, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-2, t2577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-1, t2577={5:0}, t2578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=0, t2577={5:0}, t2578={6:0}, t2579={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 [L743] 3 z = 2 [L748] 3 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: 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, 131 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: 9.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 8 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=6, InterpolantAutomatonStates: 42, 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.4s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 04:35:26,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...