/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:06:26,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:06:26,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:06:26,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:06:26,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:06:26,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:06:26,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:06:26,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:06:26,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:06:26,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:06:26,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:06:26,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:06:26,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:06:26,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:06:26,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:06:26,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:06:26,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:06:26,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:06:26,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:06:26,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:06:26,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:06:26,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:06:26,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:06:26,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:06:26,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:06:26,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:06:26,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:06:26,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:06:26,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:06:26,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:06:26,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:06:26,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:06:26,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:06:26,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:06:26,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:06:26,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:06:26,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:06:26,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:06:26,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:06:26,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:06:26,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:06:26,524 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-RepeatedSemanticLbe.epf [2022-12-05 23:06:26,544 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:06:26,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:06:26,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:06:26,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:06:26,546 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:06:26,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:06:26,546 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:06:26,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:06:26,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:06:26,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:06:26,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:06:26,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:06:26,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:06:26,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:06:26,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:06:26,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:06:26,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:06:26,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:06:26,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:06:26,549 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:06:26,549 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-05 23:06:26,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:06:26,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:06:26,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:06:26,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:06:26,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:06:26,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:06:27,685 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:06:27,915 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:06:27,915 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:06:27,924 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ceed4bde/b83eda3bbb1347abb2a1c210f8c354cf/FLAG47e388d09 [2022-12-05 23:06:27,934 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ceed4bde/b83eda3bbb1347abb2a1c210f8c354cf [2022-12-05 23:06:27,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:06:27,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:06:27,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:06:27,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:06:27,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:06:27,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:06:27" (1/1) ... [2022-12-05 23:06:27,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a485e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:27, skipping insertion in model container [2022-12-05 23:06:27,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:06:27" (1/1) ... [2022-12-05 23:06:27,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:06:27,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:06:28,135 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:06:28,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:06:28,338 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:06:28,346 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 23:06:28,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:06:28,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:06:28,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:06:28,426 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:06:28,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28 WrapperNode [2022-12-05 23:06:28,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:06:28,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:06:28,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:06:28,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:06:28,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,481 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-05 23:06:28,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:06:28,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:06:28,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:06:28,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:06:28,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,504 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:06:28,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:06:28,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:06:28,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:06:28,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (1/1) ... [2022-12-05 23:06:28,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:06:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:06:28,544 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-05 23:06:28,550 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-05 23:06:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:06:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:06:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:06:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:06:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:06:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:06:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:06:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:06:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:06:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:06:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:06:28,574 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:06:28,718 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:06:28,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:06:29,002 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:06:29,091 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:06:29,092 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:06:29,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:06:29 BoogieIcfgContainer [2022-12-05 23:06:29,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:06:29,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:06:29,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:06:29,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:06:29,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:06:27" (1/3) ... [2022-12-05 23:06:29,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c81bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:06:29, skipping insertion in model container [2022-12-05 23:06:29,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:06:28" (2/3) ... [2022-12-05 23:06:29,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c81bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:06:29, skipping insertion in model container [2022-12-05 23:06:29,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:06:29" (3/3) ... [2022-12-05 23:06:29,102 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:06:29,114 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:06:29,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:06:29,114 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:06:29,186 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:06:29,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-05 23:06:29,262 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-05 23:06:29,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:06:29,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-05 23:06:29,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-05 23:06:29,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:29,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-05 23:06:29,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-05 23:06:29,322 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-05 23:06:29,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:29,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:06:29,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-05 23:06:29,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-05 23:06:33,283 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-05 23:06:33,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:06:33,299 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;@15ba8a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:06:33,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:06:33,301 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:06:33,301 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:33,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:33,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:06:33,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 541648, now seen corresponding path program 1 times [2022-12-05 23:06:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:33,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172987110] [2022-12-05 23:06:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:33,537 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-05 23:06:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:33,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172987110] [2022-12-05 23:06:33,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172987110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:33,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:33,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:06:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845409181] [2022-12-05 23:06:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:33,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:06:33,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:06:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:06:33,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-05 23:06:33,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:33,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:33,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-05 23:06:33,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:34,330 INFO L130 PetriNetUnfolder]: 6050/8368 cut-off events. [2022-12-05 23:06:34,330 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-05 23:06:34,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16767 conditions, 8368 events. 6050/8368 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 42750 event pairs, 2306 based on Foata normal form. 0/7635 useless extension candidates. Maximal degree in co-relation 16755. Up to 6574 conditions per place. [2022-12-05 23:06:34,365 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 41 selfloop transitions, 2 changer transitions 10/56 dead transitions. [2022-12-05 23:06:34,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 239 flow [2022-12-05 23:06:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:06:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:06:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-05 23:06:34,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-05 23:06:34,375 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 67 transitions. [2022-12-05 23:06:34,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 239 flow [2022-12-05 23:06:34,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:06:34,380 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 66 flow [2022-12-05 23:06:34,381 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2022-12-05 23:06:34,384 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-05 23:06:34,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:34,385 INFO L89 Accepts]: Start accepts. Operand has 43 places, 27 transitions, 66 flow [2022-12-05 23:06:34,387 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:34,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:34,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 66 flow [2022-12-05 23:06:34,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-05 23:06:34,398 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-05 23:06:34,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:06:34,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:06:34,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-05 23:06:34,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-05 23:06:34,474 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:34,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-05 23:06:34,475 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-05 23:06:34,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:34,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:34,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:34,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:06:34,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 785827368, now seen corresponding path program 1 times [2022-12-05 23:06:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:34,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647040324] [2022-12-05 23:06:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:34,687 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-05 23:06:34,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:34,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647040324] [2022-12-05 23:06:34,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647040324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:34,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:34,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:06:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483051889] [2022-12-05 23:06:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:34,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:06:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:06:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:06:34,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:34,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:34,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:34,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:34,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:35,994 INFO L130 PetriNetUnfolder]: 13646/18640 cut-off events. [2022-12-05 23:06:35,994 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2022-12-05 23:06:36,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38657 conditions, 18640 events. 13646/18640 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 97945 event pairs, 4702 based on Foata normal form. 529/19169 useless extension candidates. Maximal degree in co-relation 38647. Up to 10935 conditions per place. [2022-12-05 23:06:36,068 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-12-05 23:06:36,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2022-12-05 23:06:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:06:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:06:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-05 23:06:36,069 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-05 23:06:36,069 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 50 transitions. [2022-12-05 23:06:36,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2022-12-05 23:06:36,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:36,071 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2022-12-05 23:06:36,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2022-12-05 23:06:36,072 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-05 23:06:36,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:36,072 INFO L89 Accepts]: Start accepts. Operand has 40 places, 33 transitions, 116 flow [2022-12-05 23:06:36,073 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:36,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:36,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 116 flow [2022-12-05 23:06:36,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 116 flow [2022-12-05 23:06:36,099 INFO L130 PetriNetUnfolder]: 165/468 cut-off events. [2022-12-05 23:06:36,099 INFO L131 PetriNetUnfolder]: For 58/71 co-relation queries the response was YES. [2022-12-05 23:06:36,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 468 events. 165/468 cut-off events. For 58/71 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3037 event pairs, 69 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 884. Up to 181 conditions per place. [2022-12-05 23:06:36,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 116 flow [2022-12-05 23:06:36,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-05 23:06:36,128 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:36,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-05 23:06:36,129 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2022-12-05 23:06:36,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:36,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:36,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:36,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:06:36,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:36,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:36,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1409155189, now seen corresponding path program 1 times [2022-12-05 23:06:36,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:36,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101953162] [2022-12-05 23:06:36,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:36,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:36,328 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-05 23:06:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:36,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101953162] [2022-12-05 23:06:36,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101953162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:36,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:36,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:06:36,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369901466] [2022-12-05 23:06:36,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:36,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:36,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:36,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:36,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:36,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:36,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:36,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:36,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:37,652 INFO L130 PetriNetUnfolder]: 13388/18294 cut-off events. [2022-12-05 23:06:37,652 INFO L131 PetriNetUnfolder]: For 6881/6881 co-relation queries the response was YES. [2022-12-05 23:06:37,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45582 conditions, 18294 events. 13388/18294 cut-off events. For 6881/6881 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 94922 event pairs, 1209 based on Foata normal form. 40/18334 useless extension candidates. Maximal degree in co-relation 45570. Up to 10001 conditions per place. [2022-12-05 23:06:37,750 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 55 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2022-12-05 23:06:37,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 66 transitions, 346 flow [2022-12-05 23:06:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 23:06:37,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:06:37,753 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 4 states and 63 transitions. [2022-12-05 23:06:37,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 66 transitions, 346 flow [2022-12-05 23:06:37,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:37,780 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 186 flow [2022-12-05 23:06:37,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2022-12-05 23:06:37,781 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-05 23:06:37,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:37,781 INFO L89 Accepts]: Start accepts. Operand has 44 places, 40 transitions, 186 flow [2022-12-05 23:06:37,782 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:37,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:37,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 40 transitions, 186 flow [2022-12-05 23:06:37,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 186 flow [2022-12-05 23:06:37,808 INFO L130 PetriNetUnfolder]: 147/420 cut-off events. [2022-12-05 23:06:37,808 INFO L131 PetriNetUnfolder]: For 294/373 co-relation queries the response was YES. [2022-12-05 23:06:37,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 420 events. 147/420 cut-off events. For 294/373 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2646 event pairs, 49 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 977. Up to 165 conditions per place. [2022-12-05 23:06:37,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 40 transitions, 186 flow [2022-12-05 23:06:37,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-05 23:06:37,839 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:37,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-05 23:06:37,841 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 186 flow [2022-12-05 23:06:37,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:37,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:37,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:37,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:06:37,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1409157142, now seen corresponding path program 1 times [2022-12-05 23:06:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:37,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904468727] [2022-12-05 23:06:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:37,980 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-05 23:06:37,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:37,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904468727] [2022-12-05 23:06:37,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904468727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:37,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:37,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:06:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135782172] [2022-12-05 23:06:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:37,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:37,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:37,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:37,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:37,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:37,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:37,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:37,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:37,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:39,230 INFO L130 PetriNetUnfolder]: 13130/17948 cut-off events. [2022-12-05 23:06:39,230 INFO L131 PetriNetUnfolder]: For 14197/14197 co-relation queries the response was YES. [2022-12-05 23:06:39,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48499 conditions, 17948 events. 13130/17948 cut-off events. For 14197/14197 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 93689 event pairs, 2522 based on Foata normal form. 40/17988 useless extension candidates. Maximal degree in co-relation 48484. Up to 10157 conditions per place. [2022-12-05 23:06:39,306 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 64 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-12-05 23:06:39,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 81 transitions, 492 flow [2022-12-05 23:06:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-05 23:06:39,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-05 23:06:39,308 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 186 flow. Second operand 4 states and 69 transitions. [2022-12-05 23:06:39,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 81 transitions, 492 flow [2022-12-05 23:06:39,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:06:39,333 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 330 flow [2022-12-05 23:06:39,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-05 23:06:39,333 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-05 23:06:39,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:39,334 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 330 flow [2022-12-05 23:06:39,334 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:39,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:39,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 330 flow [2022-12-05 23:06:39,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 330 flow [2022-12-05 23:06:39,366 INFO L130 PetriNetUnfolder]: 129/392 cut-off events. [2022-12-05 23:06:39,366 INFO L131 PetriNetUnfolder]: For 667/795 co-relation queries the response was YES. [2022-12-05 23:06:39,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 392 events. 129/392 cut-off events. For 667/795 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2449 event pairs, 27 based on Foata normal form. 2/383 useless extension candidates. Maximal degree in co-relation 1162. Up to 149 conditions per place. [2022-12-05 23:06:39,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 49 transitions, 330 flow [2022-12-05 23:06:39,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-05 23:06:39,394 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:39,400 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-05 23:06:39,400 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 330 flow [2022-12-05 23:06:39,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:39,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:39,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:06:39,400 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash -734139673, now seen corresponding path program 1 times [2022-12-05 23:06:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:39,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216149817] [2022-12-05 23:06:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:39,518 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-05 23:06:39,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:39,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216149817] [2022-12-05 23:06:39,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216149817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:39,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:39,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:06:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396048975] [2022-12-05 23:06:39,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:39,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:06:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:39,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:06:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:06:39,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:06:39,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:39,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:39,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:06:39,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:40,382 INFO L130 PetriNetUnfolder]: 6567/9710 cut-off events. [2022-12-05 23:06:40,383 INFO L131 PetriNetUnfolder]: For 16098/16890 co-relation queries the response was YES. [2022-12-05 23:06:40,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27276 conditions, 9710 events. 6567/9710 cut-off events. For 16098/16890 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 56385 event pairs, 1394 based on Foata normal form. 571/10103 useless extension candidates. Maximal degree in co-relation 27256. Up to 8056 conditions per place. [2022-12-05 23:06:40,430 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 60 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2022-12-05 23:06:40,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 620 flow [2022-12-05 23:06:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:06:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:06:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 23:06:40,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-05 23:06:40,432 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 330 flow. Second operand 3 states and 53 transitions. [2022-12-05 23:06:40,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 620 flow [2022-12-05 23:06:40,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 78 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:06:40,444 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 363 flow [2022-12-05 23:06:40,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-05 23:06:40,445 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2022-12-05 23:06:40,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:40,445 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 363 flow [2022-12-05 23:06:40,446 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:40,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:40,446 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 363 flow [2022-12-05 23:06:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 363 flow [2022-12-05 23:06:40,512 INFO L130 PetriNetUnfolder]: 503/1189 cut-off events. [2022-12-05 23:06:40,512 INFO L131 PetriNetUnfolder]: For 1090/1207 co-relation queries the response was YES. [2022-12-05 23:06:40,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 1189 events. 503/1189 cut-off events. For 1090/1207 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9050 event pairs, 204 based on Foata normal form. 5/1096 useless extension candidates. Maximal degree in co-relation 2993. Up to 592 conditions per place. [2022-12-05 23:06:40,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 363 flow [2022-12-05 23:06:40,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-05 23:06:40,532 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:40,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-05 23:06:40,534 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 363 flow [2022-12-05 23:06:40,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:40,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:40,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:40,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:06:40,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -208288131, now seen corresponding path program 1 times [2022-12-05 23:06:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:40,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940825328] [2022-12-05 23:06:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:40,667 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-05 23:06:40,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:40,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940825328] [2022-12-05 23:06:40,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940825328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:40,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:40,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038870559] [2022-12-05 23:06:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:40,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:40,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 363 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:40,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:40,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:40,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:41,902 INFO L130 PetriNetUnfolder]: 11071/15909 cut-off events. [2022-12-05 23:06:41,902 INFO L131 PetriNetUnfolder]: For 33373/33373 co-relation queries the response was YES. [2022-12-05 23:06:41,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52965 conditions, 15909 events. 11071/15909 cut-off events. For 33373/33373 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 90169 event pairs, 2389 based on Foata normal form. 223/16132 useless extension candidates. Maximal degree in co-relation 52942. Up to 7409 conditions per place. [2022-12-05 23:06:41,978 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 76 selfloop transitions, 19 changer transitions 5/100 dead transitions. [2022-12-05 23:06:41,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 777 flow [2022-12-05 23:06:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 23:06:41,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-05 23:06:41,979 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 363 flow. Second operand 4 states and 68 transitions. [2022-12-05 23:06:41,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 777 flow [2022-12-05 23:06:42,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 100 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:06:42,023 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 472 flow [2022-12-05 23:06:42,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=472, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2022-12-05 23:06:42,024 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2022-12-05 23:06:42,024 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:42,024 INFO L89 Accepts]: Start accepts. Operand has 58 places, 55 transitions, 472 flow [2022-12-05 23:06:42,024 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:42,025 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:42,025 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 55 transitions, 472 flow [2022-12-05 23:06:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 55 transitions, 472 flow [2022-12-05 23:06:42,109 INFO L130 PetriNetUnfolder]: 627/1440 cut-off events. [2022-12-05 23:06:42,109 INFO L131 PetriNetUnfolder]: For 1859/2038 co-relation queries the response was YES. [2022-12-05 23:06:42,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 1440 events. 627/1440 cut-off events. For 1859/2038 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 11374 event pairs, 281 based on Foata normal form. 7/1314 useless extension candidates. Maximal degree in co-relation 3683. Up to 889 conditions per place. [2022-12-05 23:06:42,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 55 transitions, 472 flow [2022-12-05 23:06:42,126 INFO L188 LiptonReduction]: Number of co-enabled transitions 874 [2022-12-05 23:06:42,139 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:42,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-05 23:06:42,139 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 472 flow [2022-12-05 23:06:42,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:42,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:42,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:42,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:06:42,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1420268293, now seen corresponding path program 1 times [2022-12-05 23:06:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:42,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108040369] [2022-12-05 23:06:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:42,281 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-05 23:06:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:42,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108040369] [2022-12-05 23:06:42,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108040369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:42,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:42,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610360129] [2022-12-05 23:06:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:42,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:42,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:42,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:42,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 472 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:42,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:42,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:42,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:44,115 INFO L130 PetriNetUnfolder]: 14593/21120 cut-off events. [2022-12-05 23:06:44,116 INFO L131 PetriNetUnfolder]: For 65724/65724 co-relation queries the response was YES. [2022-12-05 23:06:44,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72015 conditions, 21120 events. 14593/21120 cut-off events. For 65724/65724 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 127007 event pairs, 4711 based on Foata normal form. 204/21324 useless extension candidates. Maximal degree in co-relation 71988. Up to 10228 conditions per place. [2022-12-05 23:06:44,208 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 80 selfloop transitions, 19 changer transitions 7/106 dead transitions. [2022-12-05 23:06:44,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 926 flow [2022-12-05 23:06:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-05 23:06:44,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 23:06:44,212 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 472 flow. Second operand 4 states and 72 transitions. [2022-12-05 23:06:44,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 926 flow [2022-12-05 23:06:44,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 898 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:06:44,284 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 567 flow [2022-12-05 23:06:44,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2022-12-05 23:06:44,284 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2022-12-05 23:06:44,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:44,284 INFO L89 Accepts]: Start accepts. Operand has 63 places, 57 transitions, 567 flow [2022-12-05 23:06:44,285 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:44,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:44,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 57 transitions, 567 flow [2022-12-05 23:06:44,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 57 transitions, 567 flow [2022-12-05 23:06:44,429 INFO L130 PetriNetUnfolder]: 824/1844 cut-off events. [2022-12-05 23:06:44,429 INFO L131 PetriNetUnfolder]: For 2767/2898 co-relation queries the response was YES. [2022-12-05 23:06:44,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4648 conditions, 1844 events. 824/1844 cut-off events. For 2767/2898 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 15202 event pairs, 395 based on Foata normal form. 10/1674 useless extension candidates. Maximal degree in co-relation 4620. Up to 1264 conditions per place. [2022-12-05 23:06:44,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 57 transitions, 567 flow [2022-12-05 23:06:44,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 914 [2022-12-05 23:06:44,469 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:44,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-05 23:06:44,470 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 567 flow [2022-12-05 23:06:44,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:44,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:44,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:44,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:06:44,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1581341905, now seen corresponding path program 1 times [2022-12-05 23:06:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:44,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638141816] [2022-12-05 23:06:44,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:44,568 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-05 23:06:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:44,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638141816] [2022-12-05 23:06:44,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638141816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:44,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:44,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054436320] [2022-12-05 23:06:44,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:44,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:44,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:06:44,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:44,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:44,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:06:44,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:45,614 INFO L130 PetriNetUnfolder]: 5998/9424 cut-off events. [2022-12-05 23:06:45,615 INFO L131 PetriNetUnfolder]: For 24298/24783 co-relation queries the response was YES. [2022-12-05 23:06:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30548 conditions, 9424 events. 5998/9424 cut-off events. For 24298/24783 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 60892 event pairs, 1184 based on Foata normal form. 885/10122 useless extension candidates. Maximal degree in co-relation 30517. Up to 4743 conditions per place. [2022-12-05 23:06:45,651 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 85 selfloop transitions, 9 changer transitions 3/111 dead transitions. [2022-12-05 23:06:45,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 1208 flow [2022-12-05 23:06:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-05 23:06:45,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-12-05 23:06:45,652 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 567 flow. Second operand 4 states and 73 transitions. [2022-12-05 23:06:45,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 1208 flow [2022-12-05 23:06:45,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 111 transitions, 1162 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 23:06:45,664 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 582 flow [2022-12-05 23:06:45,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2022-12-05 23:06:45,664 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2022-12-05 23:06:45,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:45,664 INFO L89 Accepts]: Start accepts. Operand has 66 places, 60 transitions, 582 flow [2022-12-05 23:06:45,665 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:45,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:45,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 60 transitions, 582 flow [2022-12-05 23:06:45,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 60 transitions, 582 flow [2022-12-05 23:06:45,741 INFO L130 PetriNetUnfolder]: 485/1276 cut-off events. [2022-12-05 23:06:45,741 INFO L131 PetriNetUnfolder]: For 2164/2495 co-relation queries the response was YES. [2022-12-05 23:06:45,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 1276 events. 485/1276 cut-off events. For 2164/2495 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 10305 event pairs, 109 based on Foata normal form. 54/1263 useless extension candidates. Maximal degree in co-relation 4121. Up to 807 conditions per place. [2022-12-05 23:06:45,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 60 transitions, 582 flow [2022-12-05 23:06:45,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 1030 [2022-12-05 23:06:45,759 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:45,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-05 23:06:45,759 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 582 flow [2022-12-05 23:06:45,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:45,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:45,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:45,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:06:45,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 243971534, now seen corresponding path program 1 times [2022-12-05 23:06:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:45,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499890777] [2022-12-05 23:06:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:45,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:45,906 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-05 23:06:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:45,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499890777] [2022-12-05 23:06:45,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499890777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:45,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:06:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993524934] [2022-12-05 23:06:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:45,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:06:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:06:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:06:45,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:06:45,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 582 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:45,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:45,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:06:45,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:46,593 INFO L130 PetriNetUnfolder]: 4258/6682 cut-off events. [2022-12-05 23:06:46,594 INFO L131 PetriNetUnfolder]: For 18026/18426 co-relation queries the response was YES. [2022-12-05 23:06:46,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24647 conditions, 6682 events. 4258/6682 cut-off events. For 18026/18426 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 41649 event pairs, 924 based on Foata normal form. 475/6979 useless extension candidates. Maximal degree in co-relation 24614. Up to 2598 conditions per place. [2022-12-05 23:06:46,616 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 95 selfloop transitions, 13 changer transitions 7/129 dead transitions. [2022-12-05 23:06:46,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 129 transitions, 1352 flow [2022-12-05 23:06:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:06:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:06:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-05 23:06:46,618 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-05 23:06:46,618 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 582 flow. Second operand 5 states and 91 transitions. [2022-12-05 23:06:46,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 129 transitions, 1352 flow [2022-12-05 23:06:46,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 129 transitions, 1334 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:46,630 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 616 flow [2022-12-05 23:06:46,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=616, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2022-12-05 23:06:46,632 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2022-12-05 23:06:46,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:46,632 INFO L89 Accepts]: Start accepts. Operand has 69 places, 63 transitions, 616 flow [2022-12-05 23:06:46,636 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:46,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:46,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 63 transitions, 616 flow [2022-12-05 23:06:46,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 63 transitions, 616 flow [2022-12-05 23:06:46,683 INFO L130 PetriNetUnfolder]: 299/800 cut-off events. [2022-12-05 23:06:46,684 INFO L131 PetriNetUnfolder]: For 2003/2288 co-relation queries the response was YES. [2022-12-05 23:06:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3066 conditions, 800 events. 299/800 cut-off events. For 2003/2288 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5752 event pairs, 26 based on Foata normal form. 60/816 useless extension candidates. Maximal degree in co-relation 3035. Up to 445 conditions per place. [2022-12-05 23:06:46,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 63 transitions, 616 flow [2022-12-05 23:06:46,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 984 [2022-12-05 23:06:46,696 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:46,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-05 23:06:46,697 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 616 flow [2022-12-05 23:06:46,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:46,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:46,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:46,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:06:46,698 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:46,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:46,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1349696063, now seen corresponding path program 1 times [2022-12-05 23:06:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:46,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875960256] [2022-12-05 23:06:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:47,201 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-05 23:06:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875960256] [2022-12-05 23:06:47,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875960256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:06:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549020197] [2022-12-05 23:06:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:47,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:06:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:06:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:06:47,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:06:47,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 616 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-05 23:06:47,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:47,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:06:47,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:48,552 INFO L130 PetriNetUnfolder]: 9275/14361 cut-off events. [2022-12-05 23:06:48,553 INFO L131 PetriNetUnfolder]: For 63053/63053 co-relation queries the response was YES. [2022-12-05 23:06:48,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59355 conditions, 14361 events. 9275/14361 cut-off events. For 63053/63053 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 93135 event pairs, 958 based on Foata normal form. 11/14372 useless extension candidates. Maximal degree in co-relation 59321. Up to 3991 conditions per place. [2022-12-05 23:06:48,620 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 193 selfloop transitions, 59 changer transitions 37/289 dead transitions. [2022-12-05 23:06:48,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 289 transitions, 2946 flow [2022-12-05 23:06:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 23:06:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 23:06:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-05 23:06:48,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2022-12-05 23:06:48,621 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 616 flow. Second operand 9 states and 168 transitions. [2022-12-05 23:06:48,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 289 transitions, 2946 flow [2022-12-05 23:06:48,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 289 transitions, 2720 flow, removed 56 selfloop flow, removed 3 redundant places. [2022-12-05 23:06:48,925 INFO L231 Difference]: Finished difference. Result has 78 places, 99 transitions, 1228 flow [2022-12-05 23:06:48,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=78, PETRI_TRANSITIONS=99} [2022-12-05 23:06:48,925 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2022-12-05 23:06:48,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:48,925 INFO L89 Accepts]: Start accepts. Operand has 78 places, 99 transitions, 1228 flow [2022-12-05 23:06:48,926 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:48,926 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:48,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 99 transitions, 1228 flow [2022-12-05 23:06:48,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 99 transitions, 1228 flow [2022-12-05 23:06:49,114 INFO L130 PetriNetUnfolder]: 1176/2808 cut-off events. [2022-12-05 23:06:49,114 INFO L131 PetriNetUnfolder]: For 7718/8419 co-relation queries the response was YES. [2022-12-05 23:06:49,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9904 conditions, 2808 events. 1176/2808 cut-off events. For 7718/8419 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 23985 event pairs, 269 based on Foata normal form. 224/2857 useless extension candidates. Maximal degree in co-relation 9869. Up to 879 conditions per place. [2022-12-05 23:06:49,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 99 transitions, 1228 flow [2022-12-05 23:06:49,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 1290 [2022-12-05 23:06:49,416 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:06:49,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-05 23:06:49,417 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 99 transitions, 1246 flow [2022-12-05 23:06:49,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-05 23:06:49,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:49,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:49,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:06:49,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1322261277, now seen corresponding path program 2 times [2022-12-05 23:06:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:49,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526778287] [2022-12-05 23:06:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:49,827 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-05 23:06:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:49,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526778287] [2022-12-05 23:06:49,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526778287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:49,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:49,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:06:49,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272627186] [2022-12-05 23:06:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:49,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:06:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:49,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:06:49,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:06:49,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 23:06:49,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 99 transitions, 1246 flow. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-05 23:06:49,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:49,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 23:06:49,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:51,086 INFO L130 PetriNetUnfolder]: 7534/12141 cut-off events. [2022-12-05 23:06:51,086 INFO L131 PetriNetUnfolder]: For 56556/56556 co-relation queries the response was YES. [2022-12-05 23:06:51,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55560 conditions, 12141 events. 7534/12141 cut-off events. For 56556/56556 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 81128 event pairs, 1404 based on Foata normal form. 11/12152 useless extension candidates. Maximal degree in co-relation 55522. Up to 5155 conditions per place. [2022-12-05 23:06:51,185 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 139 selfloop transitions, 70 changer transitions 65/274 dead transitions. [2022-12-05 23:06:51,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 274 transitions, 2970 flow [2022-12-05 23:06:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 23:06:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 23:06:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-12-05 23:06:51,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 23:06:51,187 INFO L175 Difference]: Start difference. First operand has 78 places, 99 transitions, 1246 flow. Second operand 9 states and 156 transitions. [2022-12-05 23:06:51,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 274 transitions, 2970 flow [2022-12-05 23:06:51,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 274 transitions, 2863 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:51,494 INFO L231 Difference]: Finished difference. Result has 88 places, 112 transitions, 1508 flow [2022-12-05 23:06:51,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1508, PETRI_PLACES=88, PETRI_TRANSITIONS=112} [2022-12-05 23:06:51,495 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2022-12-05 23:06:51,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:51,495 INFO L89 Accepts]: Start accepts. Operand has 88 places, 112 transitions, 1508 flow [2022-12-05 23:06:51,496 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:51,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:51,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 112 transitions, 1508 flow [2022-12-05 23:06:51,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 112 transitions, 1508 flow [2022-12-05 23:06:51,714 INFO L130 PetriNetUnfolder]: 1183/2838 cut-off events. [2022-12-05 23:06:51,714 INFO L131 PetriNetUnfolder]: For 10378/11472 co-relation queries the response was YES. [2022-12-05 23:06:51,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11924 conditions, 2838 events. 1183/2838 cut-off events. For 10378/11472 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24174 event pairs, 270 based on Foata normal form. 239/2906 useless extension candidates. Maximal degree in co-relation 11885. Up to 893 conditions per place. [2022-12-05 23:06:51,745 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 112 transitions, 1508 flow [2022-12-05 23:06:51,745 INFO L188 LiptonReduction]: Number of co-enabled transitions 1468 [2022-12-05 23:06:51,954 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:06:51,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-05 23:06:51,955 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1524 flow [2022-12-05 23:06:51,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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-05 23:06:51,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:51,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:51,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:06:51,956 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:51,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1636592604, now seen corresponding path program 1 times [2022-12-05 23:06:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:51,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343881373] [2022-12-05 23:06:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:52,087 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-05 23:06:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:52,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343881373] [2022-12-05 23:06:52,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343881373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:52,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:52,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:06:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659395247] [2022-12-05 23:06:52,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:52,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:06:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:52,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:06:52,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:06:52,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-05 23:06:52,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1524 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:52,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:52,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-05 23:06:52,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:53,768 INFO L130 PetriNetUnfolder]: 8331/13524 cut-off events. [2022-12-05 23:06:53,768 INFO L131 PetriNetUnfolder]: For 97116/97116 co-relation queries the response was YES. [2022-12-05 23:06:53,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72443 conditions, 13524 events. 8331/13524 cut-off events. For 97116/97116 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 93337 event pairs, 912 based on Foata normal form. 25/13549 useless extension candidates. Maximal degree in co-relation 72401. Up to 5837 conditions per place. [2022-12-05 23:06:53,854 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 124 selfloop transitions, 51 changer transitions 97/272 dead transitions. [2022-12-05 23:06:53,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 272 transitions, 3679 flow [2022-12-05 23:06:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:06:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:06:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-05 23:06:53,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2022-12-05 23:06:53,856 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 1524 flow. Second operand 6 states and 103 transitions. [2022-12-05 23:06:53,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 272 transitions, 3679 flow [2022-12-05 23:06:54,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 272 transitions, 3484 flow, removed 56 selfloop flow, removed 4 redundant places. [2022-12-05 23:06:54,335 INFO L231 Difference]: Finished difference. Result has 89 places, 109 transitions, 1531 flow [2022-12-05 23:06:54,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=89, PETRI_TRANSITIONS=109} [2022-12-05 23:06:54,336 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2022-12-05 23:06:54,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:54,336 INFO L89 Accepts]: Start accepts. Operand has 89 places, 109 transitions, 1531 flow [2022-12-05 23:06:54,337 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:54,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:54,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 109 transitions, 1531 flow [2022-12-05 23:06:54,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 109 transitions, 1531 flow [2022-12-05 23:06:54,601 INFO L130 PetriNetUnfolder]: 1316/3267 cut-off events. [2022-12-05 23:06:54,601 INFO L131 PetriNetUnfolder]: For 11060/11901 co-relation queries the response was YES. [2022-12-05 23:06:54,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12966 conditions, 3267 events. 1316/3267 cut-off events. For 11060/11901 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 29628 event pairs, 305 based on Foata normal form. 296/3394 useless extension candidates. Maximal degree in co-relation 12925. Up to 1020 conditions per place. [2022-12-05 23:06:54,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 109 transitions, 1531 flow [2022-12-05 23:06:54,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 1326 [2022-12-05 23:06:54,640 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:06:54,641 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-05 23:06:54,641 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 109 transitions, 1531 flow [2022-12-05 23:06:54,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:54,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:54,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:54,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:06:54,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1912196438, now seen corresponding path program 2 times [2022-12-05 23:06:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:54,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969672995] [2022-12-05 23:06:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:54,799 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-05 23:06:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:54,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969672995] [2022-12-05 23:06:54,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969672995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:54,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:54,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:06:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336745804] [2022-12-05 23:06:54,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:54,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:06:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:06:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:06:54,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 23:06:54,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 109 transitions, 1531 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:54,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:54,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 23:06:54,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:55,616 INFO L130 PetriNetUnfolder]: 4687/7784 cut-off events. [2022-12-05 23:06:55,617 INFO L131 PetriNetUnfolder]: For 44669/45047 co-relation queries the response was YES. [2022-12-05 23:06:55,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38645 conditions, 7784 events. 4687/7784 cut-off events. For 44669/45047 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 53936 event pairs, 588 based on Foata normal form. 232/7893 useless extension candidates. Maximal degree in co-relation 38601. Up to 3154 conditions per place. [2022-12-05 23:06:55,657 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 55 selfloop transitions, 17 changer transitions 168/244 dead transitions. [2022-12-05 23:06:55,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 244 transitions, 3685 flow [2022-12-05 23:06:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:06:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:06:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-05 23:06:55,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-05 23:06:55,658 INFO L175 Difference]: Start difference. First operand has 89 places, 109 transitions, 1531 flow. Second operand 6 states and 96 transitions. [2022-12-05 23:06:55,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 244 transitions, 3685 flow [2022-12-05 23:06:55,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 244 transitions, 3658 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:06:55,993 INFO L231 Difference]: Finished difference. Result has 93 places, 46 transitions, 427 flow [2022-12-05 23:06:55,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=427, PETRI_PLACES=93, PETRI_TRANSITIONS=46} [2022-12-05 23:06:55,993 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2022-12-05 23:06:55,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:55,993 INFO L89 Accepts]: Start accepts. Operand has 93 places, 46 transitions, 427 flow [2022-12-05 23:06:55,994 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:55,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:55,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 46 transitions, 427 flow [2022-12-05 23:06:55,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 46 transitions, 427 flow [2022-12-05 23:06:56,011 INFO L130 PetriNetUnfolder]: 86/208 cut-off events. [2022-12-05 23:06:56,012 INFO L131 PetriNetUnfolder]: For 618/640 co-relation queries the response was YES. [2022-12-05 23:06:56,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 208 events. 86/208 cut-off events. For 618/640 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 884 event pairs, 15 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 890. Up to 69 conditions per place. [2022-12-05 23:06:56,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 46 transitions, 427 flow [2022-12-05 23:06:56,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-05 23:06:56,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L762: Formula: (and (= v_~a$r_buff0_thd3~0_165 v_~a$r_buff1_thd3~0_169) (= v_~a$w_buff0~0_308 1) (= v_~a$r_buff0_thd4~0_211 v_~a$r_buff1_thd4~0_212) (= v_~a$r_buff0_thd2~0_131 v_~a$r_buff1_thd2~0_136) (= v_~a$w_buff0_used~0_527 v_~a$w_buff1_used~0_462) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_73| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_73|) (= v_~a$r_buff0_thd0~0_162 v_~a$r_buff1_thd0~0_164) (= v_~x~0_88 1) (= v_~a$w_buff0_used~0_526 1) (= v_~a$w_buff0~0_309 v_~a$w_buff1~0_258) (= v_~a$r_buff0_thd1~0_187 v_~a$r_buff1_thd1~0_115) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_65| |v_P0Thread1of1ForFork3_~arg#1.base_65|) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_73| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_526 256) 0)) (not (= (mod v_~a$w_buff1_used~0_462 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_73| 0)) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_65| |v_P0Thread1of1ForFork3_~arg#1.offset_65|) (= v_~a$r_buff0_thd1~0_186 1)) InVars {P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_65|, ~a$w_buff0~0=v_~a$w_buff0~0_309, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_65|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_131, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_165, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_527, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_187, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_162, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_211} OutVars{P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_65|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_212, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_115, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_65|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_169, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_136, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_73|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_131, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_165, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_526, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_186, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_162, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_211, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_65|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_65|, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_73|, ~a$w_buff1~0=v_~a$w_buff1~0_258, ~a$w_buff0~0=v_~a$w_buff0~0_308, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_164, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_462, ~x~0=v_~x~0_88} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork3_~arg#1.base, P0Thread1of1ForFork3_~arg#1.offset, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~a$w_buff1~0, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0] and [479] $Ultimate##0-->L779: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_34 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-05 23:06:56,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] $Ultimate##0-->L802: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_13|) (= v_~z~0_86 1) (= v_~y~0_38 1) (= |v_P2Thread1of1ForFork2_#in~arg.base_13| v_P2Thread1of1ForFork2_~arg.base_13)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, ~z~0=v_~z~0_86, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0] and [382] L782-->L789: Formula: (let ((.cse3 (not (= (mod v_~a$r_buff1_thd2~0_24 256) 0))) (.cse4 (not (= (mod v_~a$w_buff0_used~0_129 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_130 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5)) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_123 256) 0))))) (and (= v_~a$r_buff0_thd2~0_25 (ite .cse0 0 v_~a$r_buff0_thd2~0_26)) (= v_~a~0_74 (ite .cse1 v_~a$w_buff0~0_52 (ite .cse2 v_~a$w_buff1~0_47 v_~a~0_75))) (= (ite .cse1 0 v_~a$w_buff0_used~0_130) v_~a$w_buff0_used~0_129) (= (ite (or .cse0 .cse2) 0 v_~a$w_buff1_used~0_123) v_~a$w_buff1_used~0_122) (= v_~a$r_buff1_thd2~0_23 (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd2~0_25 256) 0)))) 0 v_~a$r_buff1_thd2~0_24))))) InVars {~a~0=v_~a~0_75, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_24, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_26, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_130, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123} OutVars{~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_23, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_25, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_129, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0] [2022-12-05 23:06:56,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] $Ultimate##0-->L802: Formula: (and (= v_P2Thread1of1ForFork2_~arg.offset_13 |v_P2Thread1of1ForFork2_#in~arg.offset_13|) (= v_~z~0_86 1) (= v_~y~0_38 1) (= |v_P2Thread1of1ForFork2_#in~arg.base_13| v_P2Thread1of1ForFork2_~arg.base_13)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_13|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_13, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_13, ~z~0=v_~z~0_86, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_13|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0] and [416] $Ultimate##0-->L819: Formula: (and (= v_~z~0_13 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_13, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] [2022-12-05 23:06:56,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [531] $Ultimate##0-->L782: Formula: (and (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_542 256) 0)) (not (= (mod v_~a$w_buff1_used~0_474 256) 0)))) 1 0) |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_77|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19) (= v_~a$w_buff0_used~0_542 1) (= v_~a$r_buff0_thd4~0_215 v_~a$r_buff1_thd4~0_216) (= v_~a$r_buff0_thd2~0_135 v_~a$r_buff1_thd2~0_140) (= v_~a$r_buff0_thd1~0_195 v_~a$r_buff1_thd1~0_119) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_77| 0)) (= v_~a$r_buff0_thd3~0_169 v_~a$r_buff1_thd3~0_173) (= v_~a$w_buff0~0_320 1) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_69| |v_P0Thread1of1ForFork3_~arg#1.offset_69|) (= v_~a$w_buff0_used~0_543 v_~a$w_buff1_used~0_474) (= v_~a$r_buff0_thd1~0_194 1) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_77| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_77|) (= v_~a$r_buff0_thd0~0_174 v_~a$r_buff1_thd0~0_176) (= v_~a$w_buff0~0_321 v_~a$w_buff1~0_266) (= v_~x~0_96 2) (= v_~y~0_42 v_~__unbuffered_p1_EAX~0_82) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_69| |v_P0Thread1of1ForFork3_~arg#1.base_69|)) InVars {P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_69|, ~a$w_buff0~0=v_~a$w_buff0~0_321, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_69|, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_135, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_169, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_543, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_174, ~y~0=v_~y~0_42, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_215} OutVars{P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_69|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_216, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_140, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_77|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_135, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_174, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_215, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_77|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~a$w_buff1~0=v_~a$w_buff1~0_266, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_42, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_119, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_69|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_173, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_169, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_542, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_194, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_69|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_69|, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, ~a$w_buff0~0=v_~a$w_buff0~0_320, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_176, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_474, ~x~0=v_~x~0_96} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.base, ~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd3~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork3_~arg#1.base, P0Thread1of1ForFork3_~arg#1.offset, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0] and [533] $Ultimate##0-->L789: Formula: (let ((.cse1 (not (= (mod v_~a$r_buff1_thd2~0_143 256) 0))) (.cse2 (not (= (mod v_~a$w_buff0_used~0_550 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_138 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse3 (and (not (= 0 (mod v_~a$w_buff0_used~0_551 256))) .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_481 256) 0)) .cse1))) (and (= v_~z~0_94 1) (= v_~y~0_46 1) (= (ite .cse0 0 v_~a$r_buff0_thd2~0_138) v_~a$r_buff0_thd2~0_137) (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_480 256) 0)) .cse1) (and .cse2 (not (= (mod v_~a$r_buff0_thd2~0_137 256) 0)))) 0 v_~a$r_buff1_thd2~0_143) v_~a$r_buff1_thd2~0_142) (= (ite .cse3 0 v_~a$w_buff0_used~0_551) v_~a$w_buff0_used~0_550) (= (ite (or .cse4 .cse0) 0 v_~a$w_buff1_used~0_481) v_~a$w_buff1_used~0_480) (= |v_P2Thread1of1ForFork2_#in~arg.base_19| v_P2Thread1of1ForFork2_~arg.base_19) (= v_~a~0_393 (ite .cse3 v_~a$w_buff0~0_326 (ite .cse4 v_~a$w_buff1~0_270 v_~a~0_394))) (= v_P2Thread1of1ForFork2_~arg.offset_19 |v_P2Thread1of1ForFork2_#in~arg.offset_19|)))) InVars {~a~0=v_~a~0_394, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_19|, ~a$w_buff1~0=v_~a$w_buff1~0_270, ~a$w_buff0~0=v_~a$w_buff0~0_326, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_143, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_138, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_551, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_481, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_19|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_19|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_19, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_142, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_137, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_550, ~a~0=v_~a~0_393, ~a$w_buff1~0=v_~a$w_buff1~0_270, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_19, ~a$w_buff0~0=v_~a$w_buff0~0_326, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_480, ~z~0=v_~z~0_94, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_19|, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0, ~z~0, ~y~0] [2022-12-05 23:06:57,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] $Ultimate##0-->L789: Formula: (let ((.cse1 (not (= 0 (mod v_~a$w_buff0_used~0_554 256)))) (.cse0 (not (= (mod v_~a$r_buff0_thd2~0_142 256) 0))) (.cse4 (= 0 (mod v_~a$w_buff0_used~0_556 256)))) (let ((.cse3 (and .cse0 (not .cse4))) (.cse2 (and .cse0 .cse1))) (and (= |v_P2Thread1of1ForFork2_#in~arg.base_23| v_P2Thread1of1ForFork2_~arg.base_23) (= |v_P1Thread1of1ForFork1_#in~arg.offset_21| v_P1Thread1of1ForFork1_~arg.offset_21) (= v_~a$r_buff0_thd3~0_175 v_~a$r_buff1_thd3~0_179) (= v_~a$r_buff0_thd1~0_198 1) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_71| |v_P0Thread1of1ForFork3_~arg#1.offset_71|) (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_484 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_141 256) 0)))) 0 v_~a$r_buff0_thd2~0_142) v_~a$r_buff1_thd2~0_146) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_79| 0)) (= v_~a$w_buff0~0_329 v_~a$w_buff1~0_272) (= v_~x~0_98 2) (= v_~a$w_buff1_used~0_484 (ite (or .cse2 .cse3) 0 v_~a$w_buff0_used~0_556)) (= v_~a~0_397 (ite .cse0 v_~a$w_buff0~0_328 (ite .cse3 v_~a$w_buff1~0_272 v_~a~0_398))) (= v_~a$r_buff0_thd4~0_217 v_~a$r_buff1_thd4~0_218) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_79| (ite .cse4 1 0)) (= v_~a$r_buff0_thd0~0_176 v_~a$r_buff1_thd0~0_178) (= v_P1Thread1of1ForFork1_~arg.base_21 |v_P1Thread1of1ForFork1_#in~arg.base_21|) (= v_~y~0_50 1) (= v_~a$w_buff0~0_328 1) (= (ite .cse2 0 v_~a$r_buff0_thd2~0_142) v_~a$r_buff0_thd2~0_141) (= v_~z~0_100 1) (= v_~a$r_buff0_thd1~0_199 v_~a$r_buff1_thd1~0_121) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_79| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_79|) (= (ite .cse0 0 1) v_~a$w_buff0_used~0_554) (= v_P2Thread1of1ForFork2_~arg.offset_23 |v_P2Thread1of1ForFork2_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_71| |v_P0Thread1of1ForFork3_~arg#1.base_71|) (= v_~y~0_51 v_~__unbuffered_p1_EAX~0_84)))) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_71|, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_71|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_142, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_556, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_175, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_199, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_176, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_217, ~a~0=v_~a~0_398, ~a$w_buff0~0=v_~a$w_buff0~0_329, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_23|, ~y~0=v_~y~0_51} OutVars{P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_71|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_218, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_146, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_141, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_79|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_176, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_217, ~a~0=v_~a~0_397, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_79|, ~a$w_buff1~0=v_~a$w_buff1~0_272, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_50, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_23|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_21, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_121, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_71|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_179, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_554, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_175, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_198, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_71|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_71|, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_21, ~a$w_buff0~0=v_~a$w_buff0~0_328, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_21|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_484, ~z~0=v_~z~0_100, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_23|, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd3~0, ~a$r_buff0_thd2~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork3_~arg#1.base, ~a~0, P0Thread1of1ForFork3_~arg#1.offset, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, P1Thread1of1ForFork1_~arg.offset, ~a$w_buff1~0, P2Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~z~0, ~y~0, ~x~0] and [375] L762-->L769: Formula: (let ((.cse3 (not (= (mod v_~a$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_31 256) 0))) (.cse4 (not (= 0 (mod v_~a$r_buff1_thd1~0_22 256))))) (let ((.cse1 (and (not (= (mod v_~a$w_buff1_used~0_141 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_148 256) 0))))) (and (= v_~a~0_96 (ite .cse0 v_~a$w_buff0~0_62 (ite .cse1 v_~a$w_buff1~0_63 v_~a~0_97))) (= v_~a$r_buff0_thd1~0_30 (ite .cse2 0 v_~a$r_buff0_thd1~0_31)) (= v_~a$w_buff1_used~0_140 (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_141)) (= v_~a$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd1~0_30 256) 0))) (and .cse4 (not (= (mod v_~a$w_buff1_used~0_140 256) 0)))) 0 v_~a$r_buff1_thd1~0_22)) (= (ite .cse0 0 v_~a$w_buff0_used~0_148) v_~a$w_buff0_used~0_147)))) InVars {~a~0=v_~a~0_97, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_31, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_141} OutVars{~a~0=v_~a~0_96, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$w_buff0~0=v_~a$w_buff0~0_62, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_140} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] [2022-12-05 23:06:57,494 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 23:06:57,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1502 [2022-12-05 23:06:57,495 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 39 transitions, 438 flow [2022-12-05 23:06:57,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:57,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:57,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:57,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:06:57,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:57,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash 875749386, now seen corresponding path program 1 times [2022-12-05 23:06:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:57,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405624098] [2022-12-05 23:06:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:06:57,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:06:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:06:57,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:06:57,800 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:06:57,801 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 23:06:57,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 23:06:57,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 23:06:57,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 23:06:57,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 23:06:57,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 23:06:57,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 23:06:57,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:06:57,806 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:57,809 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:06:57,809 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:06:57,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:06:57 BasicIcfg [2022-12-05 23:06:57,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:06:57,882 INFO L158 Benchmark]: Toolchain (without parser) took 29942.06ms. Allocated memory was 169.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 127.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-05 23:06:57,882 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:06:57,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.33ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 99.7MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 23:06:57,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.02ms. Allocated memory is still 169.9MB. Free memory was 99.7MB in the beginning and 97.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:57,882 INFO L158 Benchmark]: Boogie Preprocessor took 25.89ms. Allocated memory is still 169.9MB. Free memory was 97.1MB in the beginning and 95.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:06:57,882 INFO L158 Benchmark]: RCFGBuilder took 587.31ms. Allocated memory is still 169.9MB. Free memory was 95.0MB in the beginning and 57.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 23:06:57,883 INFO L158 Benchmark]: TraceAbstraction took 28781.39ms. Allocated memory was 169.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 56.7MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-05 23:06:57,884 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.11ms. Allocated memory is still 169.9MB. Free memory is still 146.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 488.33ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 99.7MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.02ms. Allocated memory is still 169.9MB. Free memory was 99.7MB in the beginning and 97.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.89ms. Allocated memory is still 169.9MB. Free memory was 97.1MB in the beginning and 95.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 587.31ms. Allocated memory is still 169.9MB. Free memory was 95.0MB in the beginning and 57.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 28781.39ms. Allocated memory was 169.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 56.7MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 135 PlacesBefore, 47 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 2286, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2354, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1858, independent: 1807, independent conditional: 0, independent unconditional: 1807, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1858, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2354, independent: 479, independent conditional: 0, independent unconditional: 479, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1858, unknown conditional: 0, unknown unconditional: 1858] , Statistics on independence cache: Total cache size (in pairs): 2816, Positive cache size: 2765, Positive conditional cache size: 0, Positive unconditional cache size: 2765, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, 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, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 18, independent unconditional: 106, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 124, independent conditional: 18, independent unconditional: 106, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 18, independent unconditional: 106, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 138, independent: 115, independent conditional: 17, independent unconditional: 98, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 138, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 23, dependent conditional: 10, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 67, dependent conditional: 43, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 138, unknown conditional: 27, unknown unconditional: 111] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 115, Positive conditional cache size: 17, Positive unconditional cache size: 98, Negative cache size: 23, Negative conditional cache size: 10, Negative unconditional cache size: 13, 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, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 109, independent conditional: 17, independent unconditional: 92, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 129, Positive conditional cache size: 17, Positive unconditional cache size: 112, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169, independent: 144, independent conditional: 25, independent unconditional: 119, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 169, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 15, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 23, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, independent: 132, independent conditional: 0, independent unconditional: 132, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 141, Positive conditional cache size: 17, Positive unconditional cache size: 124, Negative cache size: 32, Negative conditional cache size: 10, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 207, independent: 178, independent conditional: 178, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 207, independent: 178, independent conditional: 43, independent unconditional: 135, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 207, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 207, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 207, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 142, Positive conditional cache size: 17, Positive unconditional cache size: 125, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 43, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 822 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 115, independent conditional: 30, independent unconditional: 85, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 142, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 142, Positive conditional cache size: 17, Positive unconditional cache size: 125, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 874 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 25, independent unconditional: 99, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 152, independent: 124, independent conditional: 4, independent unconditional: 120, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 142, Positive conditional cache size: 17, Positive unconditional cache size: 125, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 105, independent conditional: 25, independent unconditional: 80, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 105, independent conditional: 5, independent unconditional: 100, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 105, independent conditional: 5, independent unconditional: 100, dependent: 28, dependent conditional: 0, dependent unconditional: 28, 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: 133, independent: 105, independent conditional: 5, independent unconditional: 100, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 142, Positive conditional cache size: 17, Positive unconditional cache size: 125, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 96, independent conditional: 96, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 96, independent conditional: 31, independent unconditional: 65, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 96, independent conditional: 5, independent unconditional: 91, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 96, independent conditional: 5, independent unconditional: 91, dependent: 32, dependent conditional: 0, dependent unconditional: 32, 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: 128, independent: 96, independent conditional: 5, independent unconditional: 91, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 142, Positive conditional cache size: 17, Positive unconditional cache size: 125, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 102, independent conditional: 32, independent unconditional: 70, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 102, independent conditional: 5, independent unconditional: 97, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 102, independent conditional: 5, independent unconditional: 97, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 138, independent: 102, independent conditional: 5, independent unconditional: 97, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 142, Positive conditional cache size: 17, Positive unconditional cache size: 125, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 78 PlacesBefore, 78 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 1290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 130, independent unconditional: 32, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 162, independent conditional: 74, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 162, independent conditional: 74, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, independent: 145, independent conditional: 73, independent unconditional: 72, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 17, unknown conditional: 1, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 159, Positive conditional cache size: 18, Positive unconditional cache size: 141, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 86 PlacesBefore, 86 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, independent: 153, independent conditional: 153, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169, independent: 153, independent conditional: 135, independent unconditional: 18, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 169, independent: 153, independent conditional: 56, independent unconditional: 97, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169, independent: 153, independent conditional: 56, independent unconditional: 97, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, independent: 153, independent conditional: 56, independent unconditional: 97, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 162, Positive conditional cache size: 18, Positive unconditional cache size: 144, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 1326 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 162, Positive conditional cache size: 18, Positive unconditional cache size: 144, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 87 PlacesBefore, 80 PlacesAfterwards, 46 TransitionsBefore, 39 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, 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: 57, independent: 57, independent conditional: 47, independent unconditional: 10, 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: 57, independent: 57, independent conditional: 19, independent unconditional: 38, 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: 57, independent: 57, independent conditional: 19, independent unconditional: 38, 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: 24, independent: 24, independent conditional: 10, independent unconditional: 14, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 57, independent: 33, independent conditional: 9, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 10, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 243, Positive conditional cache size: 31, Positive unconditional cache size: 212, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-2, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1460; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 [L761] 1 x = 1 [L778] 1 x = 2 [L781] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=1, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 3 y = 1 [L801] 3 z = 1 [L818] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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: 862]: 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: 866]: 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: 864]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 594 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1572 IncrementalHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 50 mSDtfsCounter, 1572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1531occurred in iteration=12, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-05 23:06:57,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...