/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/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:39:43,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:39:43,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:39:43,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:39:43,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:39:43,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:39:43,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:39:43,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:39:43,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:39:43,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:39:43,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:39:43,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:39:43,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:39:43,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:39:43,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:39:43,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:39:43,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:39:43,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:39:43,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:39:43,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:39:43,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:39:43,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:39:43,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:39:43,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:39:43,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:39:43,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:39:43,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:39:43,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:39:43,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:39:43,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:39:43,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:39:43,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:39:43,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:39:43,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:39:43,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:39:43,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:39:43,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:39:43,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:39:43,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:39:43,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:39:43,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:39:43,470 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-13 00:39:43,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:39:43,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:39:43,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:39:43,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:39:43,499 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:39:43,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:39:43,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:39:43,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:39:43,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:39:43,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:39:43,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:39:43,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:39:43,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:39:43,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:39:43,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:39:43,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:39:43,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:39:43,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:39:43,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:39:43,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:39:43,780 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:39:43,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-13 00:39:44,714 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:39:44,939 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:39:44,939 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-13 00:39:44,952 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e6b30d9/ccc5f3845b4841108c38f8c48b46cf77/FLAGc9728dd76 [2022-12-13 00:39:44,964 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e6b30d9/ccc5f3845b4841108c38f8c48b46cf77 [2022-12-13 00:39:44,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:39:44,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:39:44,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:39:44,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:39:44,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:39:44,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:39:44" (1/1) ... [2022-12-13 00:39:44,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bdc18d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:44, skipping insertion in model container [2022-12-13 00:39:44,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:39:44" (1/1) ... [2022-12-13 00:39:44,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:39:45,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:39:45,153 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/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-12-13 00:39:45,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:39:45,351 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:39:45,359 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/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-12-13 00:39:45,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:39:45,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:39:45,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:39:45,447 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:39:45,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45 WrapperNode [2022-12-13 00:39:45,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:39:45,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:39:45,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:39:45,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:39:45,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,488 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 00:39:45,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:39:45,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:39:45,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:39:45,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:39:45,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,526 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:39:45,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:39:45,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:39:45,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:39:45,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (1/1) ... [2022-12-13 00:39:45,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:39:45,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:39:45,571 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:39:45,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:39:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:39:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:39:45,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:39:45,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:39:45,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:39:45,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:39:45,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:39:45,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:39:45,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:39:45,597 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:39:45,691 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:39:45,692 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:39:45,941 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:39:46,047 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:39:46,047 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:39:46,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:39:46 BoogieIcfgContainer [2022-12-13 00:39:46,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:39:46,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:39:46,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:39:46,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:39:46,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:39:44" (1/3) ... [2022-12-13 00:39:46,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8424528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:39:46, skipping insertion in model container [2022-12-13 00:39:46,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:39:45" (2/3) ... [2022-12-13 00:39:46,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8424528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:39:46, skipping insertion in model container [2022-12-13 00:39:46,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:39:46" (3/3) ... [2022-12-13 00:39:46,058 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-12-13 00:39:46,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:39:46,070 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:39:46,070 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:39:46,118 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:39:46,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 00:39:46,208 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 00:39:46,208 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:39:46,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 00:39:46,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 00:39:46,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 00:39:46,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:39:46,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 00:39:46,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 00:39:46,292 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 00:39:46,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:39:46,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 00:39:46,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 00:39:46,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-13 00:39:50,972 INFO L241 LiptonReduction]: Total number of compositions: 99 [2022-12-13 00:39:50,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:39:50,989 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;@cc3995c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:39:50,989 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:39:50,991 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:39:50,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:39:50,991 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:39:50,991 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:39:50,992 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-13 00:39:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:39:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 568663, now seen corresponding path program 1 times [2022-12-13 00:39:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:39:51,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055115579] [2022-12-13 00:39:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:39:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:39:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:39:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:39:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:39:51,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055115579] [2022-12-13 00:39:51,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055115579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:39:51,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:39:51,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:39:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441326329] [2022-12-13 00:39:51,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:39:51,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:39:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:39:51,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:39:51,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:39:51,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 83 [2022-12-13 00:39:51,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 83 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:39:51,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:39:51,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 83 [2022-12-13 00:39:51,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:39:58,644 INFO L130 PetriNetUnfolder]: 66790/97374 cut-off events. [2022-12-13 00:39:58,644 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-12-13 00:39:58,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185663 conditions, 97374 events. 66790/97374 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 4514. Compared 790516 event pairs, 9970 based on Foata normal form. 0/63342 useless extension candidates. Maximal degree in co-relation 185651. Up to 73765 conditions per place. [2022-12-13 00:39:58,986 INFO L137 encePairwiseOnDemand]: 78/83 looper letters, 48 selfloop transitions, 2 changer transitions 71/137 dead transitions. [2022-12-13 00:39:58,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 535 flow [2022-12-13 00:39:58,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:39:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:39:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-12-13 00:39:58,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7068273092369478 [2022-12-13 00:39:58,998 INFO L175 Difference]: Start difference. First operand has 95 places, 83 transitions, 178 flow. Second operand 3 states and 176 transitions. [2022-12-13 00:39:58,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 535 flow [2022-12-13 00:39:59,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 137 transitions, 528 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:39:59,004 INFO L231 Difference]: Finished difference. Result has 91 places, 44 transitions, 100 flow [2022-12-13 00:39:59,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=91, PETRI_TRANSITIONS=44} [2022-12-13 00:39:59,007 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2022-12-13 00:39:59,008 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:39:59,008 INFO L89 Accepts]: Start accepts. Operand has 91 places, 44 transitions, 100 flow [2022-12-13 00:39:59,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:39:59,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:39:59,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 44 transitions, 100 flow [2022-12-13 00:39:59,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 100 flow [2022-12-13 00:39:59,019 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 00:39:59,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:39:59,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:39:59,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 100 flow [2022-12-13 00:39:59,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-13 00:39:59,197 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:39:59,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-13 00:39:59,200 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 100 flow [2022-12-13 00:39:59,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:39:59,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:39:59,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:39:59,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:39:59,203 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-13 00:39:59,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:39:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 486257866, now seen corresponding path program 1 times [2022-12-13 00:39:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:39:59,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891799757] [2022-12-13 00:39:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:39:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:39:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:39:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:39:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:39:59,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891799757] [2022-12-13 00:39:59,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891799757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:39:59,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:39:59,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:39:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331675352] [2022-12-13 00:39:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:39:59,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:39:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:39:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:39:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:39:59,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 00:39:59,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:39:59,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:39:59,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 00:39:59,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:03,521 INFO L130 PetriNetUnfolder]: 44379/61377 cut-off events. [2022-12-13 00:40:03,522 INFO L131 PetriNetUnfolder]: For 2327/2327 co-relation queries the response was YES. [2022-12-13 00:40:03,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123719 conditions, 61377 events. 44379/61377 cut-off events. For 2327/2327 co-relation queries the response was YES. Maximal size of possible extension queue 2023. Compared 384357 event pairs, 16351 based on Foata normal form. 0/50155 useless extension candidates. Maximal degree in co-relation 123709. Up to 33709 conditions per place. [2022-12-13 00:40:03,909 INFO L137 encePairwiseOnDemand]: 35/44 looper letters, 53 selfloop transitions, 8 changer transitions 2/74 dead transitions. [2022-12-13 00:40:03,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 294 flow [2022-12-13 00:40:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:40:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:40:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-12-13 00:40:03,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2022-12-13 00:40:03,913 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 100 flow. Second operand 3 states and 97 transitions. [2022-12-13 00:40:03,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 294 flow [2022-12-13 00:40:03,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:03,916 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 156 flow [2022-12-13 00:40:03,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2022-12-13 00:40:03,917 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -38 predicate places. [2022-12-13 00:40:03,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:03,917 INFO L89 Accepts]: Start accepts. Operand has 57 places, 50 transitions, 156 flow [2022-12-13 00:40:03,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:03,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:03,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 50 transitions, 156 flow [2022-12-13 00:40:03,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 156 flow [2022-12-13 00:40:03,961 INFO L130 PetriNetUnfolder]: 230/804 cut-off events. [2022-12-13 00:40:03,961 INFO L131 PetriNetUnfolder]: For 71/79 co-relation queries the response was YES. [2022-12-13 00:40:03,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 804 events. 230/804 cut-off events. For 71/79 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6602 event pairs, 96 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 1361. Up to 273 conditions per place. [2022-12-13 00:40:03,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 50 transitions, 156 flow [2022-12-13 00:40:03,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 1354 [2022-12-13 00:40:04,032 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:04,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 00:40:04,034 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 156 flow [2022-12-13 00:40:04,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:04,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:04,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:04,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:40:04,037 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-13 00:40:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2105874409, now seen corresponding path program 1 times [2022-12-13 00:40:04,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358807098] [2022-12-13 00:40:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:04,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:04,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358807098] [2022-12-13 00:40:04,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358807098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:04,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:04,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305754016] [2022-12-13 00:40:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:04,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:40:04,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:04,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:04,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:40:04,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:07,353 INFO L130 PetriNetUnfolder]: 34525/48860 cut-off events. [2022-12-13 00:40:07,353 INFO L131 PetriNetUnfolder]: For 16046/16046 co-relation queries the response was YES. [2022-12-13 00:40:07,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114846 conditions, 48860 events. 34525/48860 cut-off events. For 16046/16046 co-relation queries the response was YES. Maximal size of possible extension queue 1727. Compared 313071 event pairs, 2343 based on Foata normal form. 60/41096 useless extension candidates. Maximal degree in co-relation 114834. Up to 25385 conditions per place. [2022-12-13 00:40:07,705 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 67 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2022-12-13 00:40:07,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 428 flow [2022-12-13 00:40:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:40:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:40:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-12-13 00:40:07,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2022-12-13 00:40:07,707 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 156 flow. Second operand 4 states and 119 transitions. [2022-12-13 00:40:07,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 428 flow [2022-12-13 00:40:07,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:07,795 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 228 flow [2022-12-13 00:40:07,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2022-12-13 00:40:07,796 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -35 predicate places. [2022-12-13 00:40:07,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:07,796 INFO L89 Accepts]: Start accepts. Operand has 60 places, 57 transitions, 228 flow [2022-12-13 00:40:07,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:07,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:07,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 57 transitions, 228 flow [2022-12-13 00:40:07,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 57 transitions, 228 flow [2022-12-13 00:40:07,832 INFO L130 PetriNetUnfolder]: 205/711 cut-off events. [2022-12-13 00:40:07,832 INFO L131 PetriNetUnfolder]: For 294/338 co-relation queries the response was YES. [2022-12-13 00:40:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 711 events. 205/711 cut-off events. For 294/338 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5532 event pairs, 49 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 1430. Up to 247 conditions per place. [2022-12-13 00:40:07,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 57 transitions, 228 flow [2022-12-13 00:40:07,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 1548 [2022-12-13 00:40:07,845 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:07,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 00:40:07,846 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 228 flow [2022-12-13 00:40:07,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:07,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:07,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:40:07,847 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-13 00:40:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2105876858, now seen corresponding path program 1 times [2022-12-13 00:40:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:07,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943971582] [2022-12-13 00:40:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:07,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:07,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943971582] [2022-12-13 00:40:07,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943971582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:07,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:07,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:07,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903917843] [2022-12-13 00:40:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:07,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:07,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:07,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:40:07,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:07,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:07,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:40:07,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:11,063 INFO L130 PetriNetUnfolder]: 33913/47955 cut-off events. [2022-12-13 00:40:11,063 INFO L131 PetriNetUnfolder]: For 31642/31642 co-relation queries the response was YES. [2022-12-13 00:40:11,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120716 conditions, 47955 events. 33913/47955 cut-off events. For 31642/31642 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 307270 event pairs, 3771 based on Foata normal form. 72/40311 useless extension candidates. Maximal degree in co-relation 120701. Up to 25207 conditions per place. [2022-12-13 00:40:11,356 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 73 selfloop transitions, 18 changer transitions 0/102 dead transitions. [2022-12-13 00:40:11,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 548 flow [2022-12-13 00:40:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:40:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:40:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-12-13 00:40:11,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2022-12-13 00:40:11,358 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 228 flow. Second operand 4 states and 124 transitions. [2022-12-13 00:40:11,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 548 flow [2022-12-13 00:40:11,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 102 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:40:11,436 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 337 flow [2022-12-13 00:40:11,437 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2022-12-13 00:40:11,438 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -30 predicate places. [2022-12-13 00:40:11,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:11,438 INFO L89 Accepts]: Start accepts. Operand has 65 places, 64 transitions, 337 flow [2022-12-13 00:40:11,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:11,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:11,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 337 flow [2022-12-13 00:40:11,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 337 flow [2022-12-13 00:40:11,478 INFO L130 PetriNetUnfolder]: 179/625 cut-off events. [2022-12-13 00:40:11,478 INFO L131 PetriNetUnfolder]: For 719/809 co-relation queries the response was YES. [2022-12-13 00:40:11,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 625 events. 179/625 cut-off events. For 719/809 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4664 event pairs, 29 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 1551. Up to 215 conditions per place. [2022-12-13 00:40:11,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 337 flow [2022-12-13 00:40:11,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 1700 [2022-12-13 00:40:11,490 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:11,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-13 00:40:11,495 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 337 flow [2022-12-13 00:40:11,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:11,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:11,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:11,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:40:11,495 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-13 00:40:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash -857598759, now seen corresponding path program 1 times [2022-12-13 00:40:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:11,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047647427] [2022-12-13 00:40:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:11,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:11,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047647427] [2022-12-13 00:40:11,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047647427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:11,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:11,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801448908] [2022-12-13 00:40:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:11,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:11,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:11,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:11,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:40:11,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:11,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:11,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:40:11,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:14,990 INFO L130 PetriNetUnfolder]: 32329/45445 cut-off events. [2022-12-13 00:40:14,990 INFO L131 PetriNetUnfolder]: For 60978/60978 co-relation queries the response was YES. [2022-12-13 00:40:15,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125618 conditions, 45445 events. 32329/45445 cut-off events. For 60978/60978 co-relation queries the response was YES. Maximal size of possible extension queue 1534. Compared 279866 event pairs, 7223 based on Foata normal form. 300/38341 useless extension candidates. Maximal degree in co-relation 125599. Up to 18757 conditions per place. [2022-12-13 00:40:15,288 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 83 selfloop transitions, 9 changer transitions 0/103 dead transitions. [2022-12-13 00:40:15,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 664 flow [2022-12-13 00:40:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:40:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:40:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-12-13 00:40:15,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2022-12-13 00:40:15,289 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 337 flow. Second operand 4 states and 115 transitions. [2022-12-13 00:40:15,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 664 flow [2022-12-13 00:40:15,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 664 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:40:15,413 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 441 flow [2022-12-13 00:40:15,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=441, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2022-12-13 00:40:15,413 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -24 predicate places. [2022-12-13 00:40:15,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:15,413 INFO L89 Accepts]: Start accepts. Operand has 71 places, 69 transitions, 441 flow [2022-12-13 00:40:15,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:15,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:15,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 69 transitions, 441 flow [2022-12-13 00:40:15,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 69 transitions, 441 flow [2022-12-13 00:40:15,443 INFO L130 PetriNetUnfolder]: 144/511 cut-off events. [2022-12-13 00:40:15,443 INFO L131 PetriNetUnfolder]: For 1020/1056 co-relation queries the response was YES. [2022-12-13 00:40:15,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1520 conditions, 511 events. 144/511 cut-off events. For 1020/1056 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3521 event pairs, 13 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1499. Up to 174 conditions per place. [2022-12-13 00:40:15,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 69 transitions, 441 flow [2022-12-13 00:40:15,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 1828 [2022-12-13 00:40:15,680 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:40:15,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-13 00:40:15,682 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 441 flow [2022-12-13 00:40:15,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:15,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:15,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:15,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:40:15,683 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-13 00:40:15,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash -600710714, now seen corresponding path program 1 times [2022-12-13 00:40:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:15,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600708388] [2022-12-13 00:40:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:15,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600708388] [2022-12-13 00:40:15,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600708388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:15,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:15,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:40:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040898681] [2022-12-13 00:40:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:15,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:40:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:40:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:40:15,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:40:15,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 441 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:15,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:15,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:40:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:21,352 INFO L130 PetriNetUnfolder]: 52701/74298 cut-off events. [2022-12-13 00:40:21,353 INFO L131 PetriNetUnfolder]: For 93446/96579 co-relation queries the response was YES. [2022-12-13 00:40:21,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191901 conditions, 74298 events. 52701/74298 cut-off events. For 93446/96579 co-relation queries the response was YES. Maximal size of possible extension queue 3158. Compared 512763 event pairs, 13622 based on Foata normal form. 5525/55227 useless extension candidates. Maximal degree in co-relation 191877. Up to 57391 conditions per place. [2022-12-13 00:40:21,926 INFO L137 encePairwiseOnDemand]: 28/43 looper letters, 112 selfloop transitions, 26 changer transitions 0/165 dead transitions. [2022-12-13 00:40:21,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 165 transitions, 1179 flow [2022-12-13 00:40:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:40:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:40:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2022-12-13 00:40:21,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7395348837209302 [2022-12-13 00:40:21,928 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 441 flow. Second operand 5 states and 159 transitions. [2022-12-13 00:40:21,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 165 transitions, 1179 flow [2022-12-13 00:40:21,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 165 transitions, 1176 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:40:22,000 INFO L231 Difference]: Finished difference. Result has 77 places, 94 transitions, 633 flow [2022-12-13 00:40:22,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=633, PETRI_PLACES=77, PETRI_TRANSITIONS=94} [2022-12-13 00:40:22,002 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -18 predicate places. [2022-12-13 00:40:22,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:22,002 INFO L89 Accepts]: Start accepts. Operand has 77 places, 94 transitions, 633 flow [2022-12-13 00:40:22,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:22,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:22,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 94 transitions, 633 flow [2022-12-13 00:40:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 94 transitions, 633 flow [2022-12-13 00:40:23,268 INFO L130 PetriNetUnfolder]: 11673/18376 cut-off events. [2022-12-13 00:40:23,269 INFO L131 PetriNetUnfolder]: For 13503/31039 co-relation queries the response was YES. [2022-12-13 00:40:23,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55921 conditions, 18376 events. 11673/18376 cut-off events. For 13503/31039 co-relation queries the response was YES. Maximal size of possible extension queue 2991. Compared 162845 event pairs, 6267 based on Foata normal form. 26/8174 useless extension candidates. Maximal degree in co-relation 55896. Up to 15113 conditions per place. [2022-12-13 00:40:23,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 94 transitions, 633 flow [2022-12-13 00:40:23,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 3008 [2022-12-13 00:40:47,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:40:47,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25470 [2022-12-13 00:40:47,473 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 93 transitions, 627 flow [2022-12-13 00:40:47,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:47,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:47,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:40:47,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:40:47,473 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-13 00:40:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1411230009, now seen corresponding path program 1 times [2022-12-13 00:40:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:47,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655920159] [2022-12-13 00:40:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:47,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655920159] [2022-12-13 00:40:47,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655920159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:47,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:47,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:40:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603523753] [2022-12-13 00:40:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:47,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:40:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:40:47,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:40:47,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 00:40:47,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 93 transitions, 627 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:47,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:47,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 00:40:47,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:40:51,752 INFO L130 PetriNetUnfolder]: 35938/53252 cut-off events. [2022-12-13 00:40:51,752 INFO L131 PetriNetUnfolder]: For 77254/79071 co-relation queries the response was YES. [2022-12-13 00:40:51,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196924 conditions, 53252 events. 35938/53252 cut-off events. For 77254/79071 co-relation queries the response was YES. Maximal size of possible extension queue 2505. Compared 388913 event pairs, 4076 based on Foata normal form. 4686/40720 useless extension candidates. Maximal degree in co-relation 196896. Up to 33193 conditions per place. [2022-12-13 00:40:52,165 INFO L137 encePairwiseOnDemand]: 28/43 looper letters, 131 selfloop transitions, 38 changer transitions 0/196 dead transitions. [2022-12-13 00:40:52,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 196 transitions, 1611 flow [2022-12-13 00:40:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:40:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:40:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2022-12-13 00:40:52,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2022-12-13 00:40:52,167 INFO L175 Difference]: Start difference. First operand has 77 places, 93 transitions, 627 flow. Second operand 6 states and 195 transitions. [2022-12-13 00:40:52,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 196 transitions, 1611 flow [2022-12-13 00:40:53,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 196 transitions, 1596 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:40:53,609 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 868 flow [2022-12-13 00:40:53,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=868, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2022-12-13 00:40:53,610 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -14 predicate places. [2022-12-13 00:40:53,610 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:40:53,610 INFO L89 Accepts]: Start accepts. Operand has 81 places, 106 transitions, 868 flow [2022-12-13 00:40:53,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:40:53,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:40:53,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 106 transitions, 868 flow [2022-12-13 00:40:53,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 106 transitions, 868 flow [2022-12-13 00:40:54,428 INFO L130 PetriNetUnfolder]: 9042/15105 cut-off events. [2022-12-13 00:40:54,428 INFO L131 PetriNetUnfolder]: For 20338/63415 co-relation queries the response was YES. [2022-12-13 00:40:54,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70465 conditions, 15105 events. 9042/15105 cut-off events. For 20338/63415 co-relation queries the response was YES. Maximal size of possible extension queue 2385. Compared 134905 event pairs, 2307 based on Foata normal form. 37/7078 useless extension candidates. Maximal degree in co-relation 70437. Up to 12511 conditions per place. [2022-12-13 00:40:54,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 106 transitions, 868 flow [2022-12-13 00:40:54,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 3470 [2022-12-13 00:40:54,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [402] L847-->L850: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:54,654 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [380] L771-->L774: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:54,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [439] L847-->P3FINAL: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= |v_P3Thread1of1ForFork0_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:40:54,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [549] L771-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork3_#res#1.base_7| 0) (= v_~__unbuffered_cnt~0_191 (+ v_~__unbuffered_cnt~0_192 1)) (= |v_P0Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_192} OutVars{P0Thread1of1ForFork3_#res#1.offset=|v_P0Thread1of1ForFork3_#res#1.offset_7|, P0Thread1of1ForFork3_#res#1.base=|v_P0Thread1of1ForFork3_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res#1.offset, P0Thread1of1ForFork3_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 00:40:54,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [387] L791-->L794: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:54,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [497] L811-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_105 (+ v_~__unbuffered_cnt~0_106 1)) (= |v_P2Thread1of1ForFork2_#res.base_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 00:40:54,763 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [551] L847-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_13| 0) (= v_~__unbuffered_cnt~0_203 (+ v_~__unbuffered_cnt~0_204 1)) (= |v_P3Thread1of1ForFork0_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_204} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_13|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_203} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:40:54,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [548] L791-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_183 (+ v_~__unbuffered_cnt~0_184 1)) (= |v_P1Thread1of1ForFork1_#res.offset_15| 0) (= |v_P1Thread1of1ForFork1_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_184} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 00:40:54,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [394] L811-->L814: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:40:54,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [499] L791-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= |v_P1Thread1of1ForFork1_#res.base_5| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-13 00:40:54,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [416] L811-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P2Thread1of1ForFork2_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 00:40:54,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L871-3-->L2: Formula: (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_75 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_20) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_20 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_13|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [550] L771-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res#1.base_9| 0) (= |v_P0Thread1of1ForFork3_#res#1.offset_9| 0) (= v_~__unbuffered_cnt~0_195 (+ v_~__unbuffered_cnt~0_196 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_196} OutVars{P0Thread1of1ForFork3_#res#1.offset=|v_P0Thread1of1ForFork3_#res#1.offset_9|, P0Thread1of1ForFork3_#res#1.base=|v_P0Thread1of1ForFork3_#res#1.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res#1.offset, P0Thread1of1ForFork3_#res#1.base, ~__unbuffered_cnt~0] [2022-12-13 00:40:56,083 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:40:56,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2473 [2022-12-13 00:40:56,084 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 908 flow [2022-12-13 00:40:56,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:56,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:40:56,084 INFO L214 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-13 00:40:56,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:40:56,084 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-13 00:40:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:40:56,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1900112445, now seen corresponding path program 1 times [2022-12-13 00:40:56,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:40:56,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625380540] [2022-12-13 00:40:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:40:56,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:40:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:40:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:40:56,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:40:56,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625380540] [2022-12-13 00:40:56,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625380540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:40:56,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:40:56,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:40:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10528890] [2022-12-13 00:40:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:40:56,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:40:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:40:56,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:40:56,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:40:56,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 55 [2022-12-13 00:40:56,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 105 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:40:56,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:40:56,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 55 [2022-12-13 00:40:56,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:03,893 INFO L130 PetriNetUnfolder]: 50989/76475 cut-off events. [2022-12-13 00:41:03,893 INFO L131 PetriNetUnfolder]: For 201696/217104 co-relation queries the response was YES. [2022-12-13 00:41:04,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375944 conditions, 76475 events. 50989/76475 cut-off events. For 201696/217104 co-relation queries the response was YES. Maximal size of possible extension queue 4223. Compared 604859 event pairs, 16021 based on Foata normal form. 2941/62267 useless extension candidates. Maximal degree in co-relation 375913. Up to 46275 conditions per place. [2022-12-13 00:41:04,669 INFO L137 encePairwiseOnDemand]: 52/55 looper letters, 114 selfloop transitions, 12 changer transitions 0/157 dead transitions. [2022-12-13 00:41:04,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 157 transitions, 1616 flow [2022-12-13 00:41:04,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:41:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:41:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-12-13 00:41:04,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2022-12-13 00:41:04,672 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 908 flow. Second operand 3 states and 118 transitions. [2022-12-13 00:41:04,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 157 transitions, 1616 flow [2022-12-13 00:41:39,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 157 transitions, 1306 flow, removed 134 selfloop flow, removed 3 redundant places. [2022-12-13 00:41:39,101 INFO L231 Difference]: Finished difference. Result has 80 places, 105 transitions, 774 flow [2022-12-13 00:41:39,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=80, PETRI_TRANSITIONS=105} [2022-12-13 00:41:39,103 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -15 predicate places. [2022-12-13 00:41:39,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:39,103 INFO L89 Accepts]: Start accepts. Operand has 80 places, 105 transitions, 774 flow [2022-12-13 00:41:39,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:39,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:39,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 105 transitions, 774 flow [2022-12-13 00:41:39,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 105 transitions, 774 flow [2022-12-13 00:41:40,567 INFO L130 PetriNetUnfolder]: 15461/24770 cut-off events. [2022-12-13 00:41:40,567 INFO L131 PetriNetUnfolder]: For 25003/41116 co-relation queries the response was YES. [2022-12-13 00:41:40,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93138 conditions, 24770 events. 15461/24770 cut-off events. For 25003/41116 co-relation queries the response was YES. Maximal size of possible extension queue 4023. Compared 224122 event pairs, 4134 based on Foata normal form. 47/10696 useless extension candidates. Maximal degree in co-relation 93111. Up to 21313 conditions per place. [2022-12-13 00:41:40,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 105 transitions, 774 flow [2022-12-13 00:41:40,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 3390 [2022-12-13 00:41:41,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:41:41,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2762 [2022-12-13 00:41:41,865 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 105 transitions, 774 flow [2022-12-13 00:41:41,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:41,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:41:41,865 INFO L214 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-13 00:41:41,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:41:41,865 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-13 00:41:41,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:41:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 372003658, now seen corresponding path program 1 times [2022-12-13 00:41:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:41:41,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137424204] [2022-12-13 00:41:41,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:41:41,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:41:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:41:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:41:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:41:41,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137424204] [2022-12-13 00:41:41,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137424204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:41:41,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:41:41,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:41:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996251083] [2022-12-13 00:41:41,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:41:41,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:41:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:41:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:41:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:41:41,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2022-12-13 00:41:41,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 105 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:41:41,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:41:41,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2022-12-13 00:41:41,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:41:47,419 INFO L130 PetriNetUnfolder]: 42397/64891 cut-off events. [2022-12-13 00:41:47,419 INFO L131 PetriNetUnfolder]: For 95277/96842 co-relation queries the response was YES. [2022-12-13 00:41:47,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265664 conditions, 64891 events. 42397/64891 cut-off events. For 95277/96842 co-relation queries the response was YES. Maximal size of possible extension queue 3243. Compared 519049 event pairs, 1579 based on Foata normal form. 4952/45325 useless extension candidates. Maximal degree in co-relation 265634. Up to 37954 conditions per place. [2022-12-13 00:41:47,811 INFO L137 encePairwiseOnDemand]: 28/55 looper letters, 117 selfloop transitions, 62 changer transitions 23/229 dead transitions. [2022-12-13 00:41:47,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 229 transitions, 2045 flow [2022-12-13 00:41:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:41:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:41:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2022-12-13 00:41:47,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625974025974026 [2022-12-13 00:41:47,813 INFO L175 Difference]: Start difference. First operand has 80 places, 105 transitions, 774 flow. Second operand 7 states and 241 transitions. [2022-12-13 00:41:47,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 229 transitions, 2045 flow [2022-12-13 00:41:48,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 229 transitions, 2005 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:41:48,410 INFO L231 Difference]: Finished difference. Result has 88 places, 130 transitions, 1174 flow [2022-12-13 00:41:48,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1174, PETRI_PLACES=88, PETRI_TRANSITIONS=130} [2022-12-13 00:41:48,411 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -7 predicate places. [2022-12-13 00:41:48,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:41:48,411 INFO L89 Accepts]: Start accepts. Operand has 88 places, 130 transitions, 1174 flow [2022-12-13 00:41:48,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:41:48,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:41:48,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 130 transitions, 1174 flow [2022-12-13 00:41:48,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 130 transitions, 1174 flow [2022-12-13 00:41:49,763 INFO L130 PetriNetUnfolder]: 10214/18407 cut-off events. [2022-12-13 00:41:49,764 INFO L131 PetriNetUnfolder]: For 38291/80117 co-relation queries the response was YES. [2022-12-13 00:41:49,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95142 conditions, 18407 events. 10214/18407 cut-off events. For 38291/80117 co-relation queries the response was YES. Maximal size of possible extension queue 3177. Compared 182740 event pairs, 759 based on Foata normal form. 4/7851 useless extension candidates. Maximal degree in co-relation 95111. Up to 16291 conditions per place. [2022-12-13 00:41:49,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 130 transitions, 1174 flow [2022-12-13 00:41:49,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 3872 [2022-12-13 00:42:22,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:42:22,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33623 [2022-12-13 00:42:22,034 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 129 transitions, 1164 flow [2022-12-13 00:42:22,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:22,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:42:22,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:42:22,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:42:22,035 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-13 00:42:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:42:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1369906296, now seen corresponding path program 1 times [2022-12-13 00:42:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:42:22,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186352254] [2022-12-13 00:42:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:42:22,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:42:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:42:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:42:22,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:42:22,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186352254] [2022-12-13 00:42:22,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186352254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:42:22,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:42:22,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:42:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973122073] [2022-12-13 00:42:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:42:22,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:42:22,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:42:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:42:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:42:22,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2022-12-13 00:42:22,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 129 transitions, 1164 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:42:22,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:42:22,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2022-12-13 00:42:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:42:32,439 INFO L130 PetriNetUnfolder]: 70022/107453 cut-off events. [2022-12-13 00:42:32,439 INFO L131 PetriNetUnfolder]: For 325695/336190 co-relation queries the response was YES. [2022-12-13 00:42:33,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547884 conditions, 107453 events. 70022/107453 cut-off events. For 325695/336190 co-relation queries the response was YES. Maximal size of possible extension queue 6548. Compared 940553 event pairs, 7392 based on Foata normal form. 3136/82255 useless extension candidates. Maximal degree in co-relation 547850. Up to 70446 conditions per place. [2022-12-13 00:42:33,332 INFO L137 encePairwiseOnDemand]: 48/55 looper letters, 224 selfloop transitions, 10 changer transitions 105/386 dead transitions. [2022-12-13 00:42:33,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 386 transitions, 4177 flow [2022-12-13 00:42:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:42:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:42:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2022-12-13 00:42:33,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6961038961038961 [2022-12-13 00:42:33,333 INFO L175 Difference]: Start difference. First operand has 88 places, 129 transitions, 1164 flow. Second operand 7 states and 268 transitions. [2022-12-13 00:42:33,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 386 transitions, 4177 flow [2022-12-13 00:45:18,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 386 transitions, 3328 flow, removed 262 selfloop flow, removed 4 redundant places. [2022-12-13 00:45:18,071 INFO L231 Difference]: Finished difference. Result has 93 places, 137 transitions, 1012 flow [2022-12-13 00:45:18,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1012, PETRI_PLACES=93, PETRI_TRANSITIONS=137} [2022-12-13 00:45:18,072 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -2 predicate places. [2022-12-13 00:45:18,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:18,072 INFO L89 Accepts]: Start accepts. Operand has 93 places, 137 transitions, 1012 flow [2022-12-13 00:45:18,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:18,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:18,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 137 transitions, 1012 flow [2022-12-13 00:45:18,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 137 transitions, 1012 flow [2022-12-13 00:45:20,726 INFO L130 PetriNetUnfolder]: 26931/44977 cut-off events. [2022-12-13 00:45:20,726 INFO L131 PetriNetUnfolder]: For 51546/56121 co-relation queries the response was YES. [2022-12-13 00:45:20,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168555 conditions, 44977 events. 26931/44977 cut-off events. For 51546/56121 co-relation queries the response was YES. Maximal size of possible extension queue 5853. Compared 444175 event pairs, 1687 based on Foata normal form. 8/18697 useless extension candidates. Maximal degree in co-relation 168522. Up to 23851 conditions per place. [2022-12-13 00:45:21,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 137 transitions, 1012 flow [2022-12-13 00:45:21,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 4454 [2022-12-13 00:45:21,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:21,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3443 [2022-12-13 00:45:21,515 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 137 transitions, 1012 flow [2022-12-13 00:45:21,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:21,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:21,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:21,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:45:21,515 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-13 00:45:21,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash 216763913, now seen corresponding path program 1 times [2022-12-13 00:45:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:21,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390050036] [2022-12-13 00:45:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:21,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390050036] [2022-12-13 00:45:21,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390050036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:21,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:21,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:45:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018837914] [2022-12-13 00:45:21,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:21,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:45:21,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:45:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:45:21,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 55 [2022-12-13 00:45:21,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 137 transitions, 1012 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:21,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:21,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 55 [2022-12-13 00:45:21,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:30,599 INFO L130 PetriNetUnfolder]: 66437/101801 cut-off events. [2022-12-13 00:45:30,599 INFO L131 PetriNetUnfolder]: For 155989/157837 co-relation queries the response was YES. [2022-12-13 00:45:31,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433563 conditions, 101801 events. 66437/101801 cut-off events. For 155989/157837 co-relation queries the response was YES. Maximal size of possible extension queue 5586. Compared 871038 event pairs, 896 based on Foata normal form. 4038/61028 useless extension candidates. Maximal degree in co-relation 433527. Up to 40231 conditions per place. [2022-12-13 00:45:31,279 INFO L137 encePairwiseOnDemand]: 28/55 looper letters, 108 selfloop transitions, 74 changer transitions 59/262 dead transitions. [2022-12-13 00:45:31,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 262 transitions, 2415 flow [2022-12-13 00:45:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:45:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:45:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2022-12-13 00:45:31,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5313131313131313 [2022-12-13 00:45:31,281 INFO L175 Difference]: Start difference. First operand has 93 places, 137 transitions, 1012 flow. Second operand 9 states and 263 transitions. [2022-12-13 00:45:31,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 262 transitions, 2415 flow [2022-12-13 00:45:51,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 262 transitions, 2349 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-13 00:45:51,556 INFO L231 Difference]: Finished difference. Result has 101 places, 126 transitions, 1060 flow [2022-12-13 00:45:51,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1060, PETRI_PLACES=101, PETRI_TRANSITIONS=126} [2022-12-13 00:45:51,557 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2022-12-13 00:45:51,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:51,557 INFO L89 Accepts]: Start accepts. Operand has 101 places, 126 transitions, 1060 flow [2022-12-13 00:45:51,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:51,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:51,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 126 transitions, 1060 flow [2022-12-13 00:45:51,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 126 transitions, 1060 flow [2022-12-13 00:45:52,200 INFO L130 PetriNetUnfolder]: 6213/11523 cut-off events. [2022-12-13 00:45:52,201 INFO L131 PetriNetUnfolder]: For 17851/21465 co-relation queries the response was YES. [2022-12-13 00:45:52,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51708 conditions, 11523 events. 6213/11523 cut-off events. For 17851/21465 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 107148 event pairs, 6 based on Foata normal form. 4/4419 useless extension candidates. Maximal degree in co-relation 51673. Up to 5392 conditions per place. [2022-12-13 00:45:52,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 126 transitions, 1060 flow [2022-12-13 00:45:52,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 3342 [2022-12-13 00:45:52,730 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:45:52,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1174 [2022-12-13 00:45:52,731 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 125 transitions, 1062 flow [2022-12-13 00:45:52,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:52,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:52,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:52,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:45:52,732 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-13 00:45:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash -690058055, now seen corresponding path program 1 times [2022-12-13 00:45:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342763890] [2022-12-13 00:45:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:45:53,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342763890] [2022-12-13 00:45:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342763890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:53,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:53,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:45:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489931255] [2022-12-13 00:45:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:45:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:45:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:45:53,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2022-12-13 00:45:53,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 125 transitions, 1062 flow. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:45:53,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:53,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2022-12-13 00:45:53,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:56,900 INFO L130 PetriNetUnfolder]: 22896/36049 cut-off events. [2022-12-13 00:45:56,901 INFO L131 PetriNetUnfolder]: For 95519/98335 co-relation queries the response was YES. [2022-12-13 00:45:57,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175265 conditions, 36049 events. 22896/36049 cut-off events. For 95519/98335 co-relation queries the response was YES. Maximal size of possible extension queue 2307. Compared 289504 event pairs, 1812 based on Foata normal form. 1175/27158 useless extension candidates. Maximal degree in co-relation 175227. Up to 17741 conditions per place. [2022-12-13 00:45:57,197 INFO L137 encePairwiseOnDemand]: 49/55 looper letters, 184 selfloop transitions, 8 changer transitions 55/288 dead transitions. [2022-12-13 00:45:57,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 288 transitions, 2918 flow [2022-12-13 00:45:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:45:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:45:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-12-13 00:45:57,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2022-12-13 00:45:57,199 INFO L175 Difference]: Start difference. First operand has 97 places, 125 transitions, 1062 flow. Second operand 6 states and 213 transitions. [2022-12-13 00:45:57,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 288 transitions, 2918 flow [2022-12-13 00:46:03,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 288 transitions, 2397 flow, removed 77 selfloop flow, removed 11 redundant places. [2022-12-13 00:46:03,119 INFO L231 Difference]: Finished difference. Result has 92 places, 127 transitions, 875 flow [2022-12-13 00:46:03,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=92, PETRI_TRANSITIONS=127} [2022-12-13 00:46:03,120 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2022-12-13 00:46:03,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:03,120 INFO L89 Accepts]: Start accepts. Operand has 92 places, 127 transitions, 875 flow [2022-12-13 00:46:03,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:03,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:03,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 127 transitions, 875 flow [2022-12-13 00:46:03,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 127 transitions, 875 flow [2022-12-13 00:46:03,838 INFO L130 PetriNetUnfolder]: 7663/13983 cut-off events. [2022-12-13 00:46:03,838 INFO L131 PetriNetUnfolder]: For 11563/12185 co-relation queries the response was YES. [2022-12-13 00:46:03,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45293 conditions, 13983 events. 7663/13983 cut-off events. For 11563/12185 co-relation queries the response was YES. Maximal size of possible extension queue 2283. Compared 132739 event pairs, 3 based on Foata normal form. 15/5178 useless extension candidates. Maximal degree in co-relation 45263. Up to 4428 conditions per place. [2022-12-13 00:46:03,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 127 transitions, 875 flow [2022-12-13 00:46:03,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 3422 [2022-12-13 00:46:04,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:04,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 922 [2022-12-13 00:46:04,042 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 127 transitions, 875 flow [2022-12-13 00:46:04,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:04,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:04,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:04,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:46:04,055 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-13 00:46:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2116387064, now seen corresponding path program 1 times [2022-12-13 00:46:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:04,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050235466] [2022-12-13 00:46:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:46:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:04,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050235466] [2022-12-13 00:46:04,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050235466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:04,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:04,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:46:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030016210] [2022-12-13 00:46:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:04,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:46:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:46:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:46:04,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 55 [2022-12-13 00:46:04,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 127 transitions, 875 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:04,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:04,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 55 [2022-12-13 00:46:04,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:09,142 INFO L130 PetriNetUnfolder]: 35531/56035 cut-off events. [2022-12-13 00:46:09,143 INFO L131 PetriNetUnfolder]: For 134035/137230 co-relation queries the response was YES. [2022-12-13 00:46:09,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229866 conditions, 56035 events. 35531/56035 cut-off events. For 134035/137230 co-relation queries the response was YES. Maximal size of possible extension queue 3689. Compared 473644 event pairs, 8220 based on Foata normal form. 1673/42378 useless extension candidates. Maximal degree in co-relation 229833. Up to 26653 conditions per place. [2022-12-13 00:46:09,565 INFO L137 encePairwiseOnDemand]: 51/55 looper letters, 72 selfloop transitions, 1 changer transitions 124/227 dead transitions. [2022-12-13 00:46:09,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 227 transitions, 1927 flow [2022-12-13 00:46:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:46:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:46:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-12-13 00:46:09,567 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-12-13 00:46:09,567 INFO L175 Difference]: Start difference. First operand has 92 places, 127 transitions, 875 flow. Second operand 4 states and 150 transitions. [2022-12-13 00:46:09,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 227 transitions, 1927 flow [2022-12-13 00:46:25,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 227 transitions, 1905 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 00:46:26,001 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 643 flow [2022-12-13 00:46:26,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=643, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2022-12-13 00:46:26,002 INFO L295 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2022-12-13 00:46:26,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:26,002 INFO L89 Accepts]: Start accepts. Operand has 94 places, 98 transitions, 643 flow [2022-12-13 00:46:26,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:26,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:26,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 98 transitions, 643 flow [2022-12-13 00:46:26,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 643 flow [2022-12-13 00:46:26,193 INFO L130 PetriNetUnfolder]: 1925/3714 cut-off events. [2022-12-13 00:46:26,193 INFO L131 PetriNetUnfolder]: For 4144/4227 co-relation queries the response was YES. [2022-12-13 00:46:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12247 conditions, 3714 events. 1925/3714 cut-off events. For 4144/4227 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 30190 event pairs, 0 based on Foata normal form. 2/1243 useless extension candidates. Maximal degree in co-relation 12216. Up to 1540 conditions per place. [2022-12-13 00:46:26,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 98 transitions, 643 flow [2022-12-13 00:46:26,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 2006 [2022-12-13 00:46:26,499 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:46:26,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 498 [2022-12-13 00:46:26,500 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 591 flow [2022-12-13 00:46:26,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:46:26,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:26,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:26,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:46:26,500 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-13 00:46:26,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1752543519, now seen corresponding path program 1 times [2022-12-13 00:46:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:26,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933056177] [2022-12-13 00:46:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:26,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:46:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:26,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:46:26,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:46:26,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:46:26,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:46:26,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:46:26,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:46:26,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:46:26,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:46:26,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:46:26,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:46:26,659 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:26,662 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:46:26,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:46:26,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:26 BasicIcfg [2022-12-13 00:46:26,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:46:26,745 INFO L158 Benchmark]: Toolchain (without parser) took 401779.20ms. Allocated memory was 199.2MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 156.8MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 622.3MB. Max. memory is 8.0GB. [2022-12-13 00:46:26,746 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:46:26,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.72ms. Allocated memory is still 199.2MB. Free memory was 156.8MB in the beginning and 129.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:46:26,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.51ms. Allocated memory is still 199.2MB. Free memory was 129.0MB in the beginning and 126.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:26,746 INFO L158 Benchmark]: Boogie Preprocessor took 44.56ms. Allocated memory is still 199.2MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:26,746 INFO L158 Benchmark]: RCFGBuilder took 515.33ms. Allocated memory is still 199.2MB. Free memory was 124.3MB in the beginning and 85.5MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-13 00:46:26,746 INFO L158 Benchmark]: TraceAbstraction took 400694.41ms. Allocated memory was 199.2MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 84.5MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 549.9MB. Max. memory is 8.0GB. [2022-12-13 00:46:26,747 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.13ms. Allocated memory is still 199.2MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 480.72ms. Allocated memory is still 199.2MB. Free memory was 156.8MB in the beginning and 129.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.51ms. Allocated memory is still 199.2MB. Free memory was 129.0MB in the beginning and 126.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.56ms. Allocated memory is still 199.2MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 515.33ms. Allocated memory is still 199.2MB. Free memory was 124.3MB in the beginning and 85.5MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 400694.41ms. Allocated memory was 199.2MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 84.5MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 549.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 137 PlacesBefore, 95 PlacesAfterwards, 126 TransitionsBefore, 83 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 4 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5536, independent: 5377, independent conditional: 5377, independent unconditional: 0, dependent: 159, dependent conditional: 159, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5536, independent: 5377, independent conditional: 0, independent unconditional: 5377, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5536, independent: 5377, independent conditional: 0, independent unconditional: 5377, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5536, independent: 5377, independent conditional: 0, independent unconditional: 5377, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2962, independent: 2898, independent conditional: 0, independent unconditional: 2898, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2962, independent: 2875, independent conditional: 0, independent unconditional: 2875, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 225, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5536, independent: 2479, independent conditional: 0, independent unconditional: 2479, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 2962, unknown conditional: 0, unknown unconditional: 2962] , Statistics on independence cache: Total cache size (in pairs): 5364, Positive cache size: 5300, Positive conditional cache size: 0, Positive unconditional cache size: 5300, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 445, independent: 397, independent conditional: 397, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 445, independent: 397, independent conditional: 24, independent unconditional: 373, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 445, independent: 397, independent conditional: 24, independent unconditional: 373, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 445, independent: 397, independent conditional: 24, independent unconditional: 373, dependent: 48, dependent conditional: 18, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 404, independent: 368, independent conditional: 23, independent unconditional: 345, dependent: 36, dependent conditional: 10, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 404, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 120, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 36, dependent conditional: 10, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 165, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 97, dependent conditional: 53, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 445, independent: 29, independent conditional: 1, independent unconditional: 28, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 404, unknown conditional: 33, unknown unconditional: 371] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 368, Positive conditional cache size: 23, Positive unconditional cache size: 345, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 56 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 1354 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 394, independent: 358, independent conditional: 358, 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: 394, independent: 358, independent conditional: 25, independent unconditional: 333, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 394, independent: 358, independent conditional: 0, independent unconditional: 358, 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: 394, independent: 358, independent conditional: 0, independent unconditional: 358, 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: 56, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 394, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 414, Positive conditional cache size: 23, Positive unconditional cache size: 391, Negative cache size: 46, Negative conditional cache size: 10, Negative unconditional cache size: 36, 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.0s, 60 PlacesBefore, 60 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1548 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 391, independent conditional: 391, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 430, independent: 391, independent conditional: 32, independent unconditional: 359, dependent: 39, dependent conditional: 3, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 39, dependent conditional: 0, dependent unconditional: 39, 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: 430, independent: 391, independent conditional: 0, independent unconditional: 391, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 414, Positive conditional cache size: 23, Positive unconditional cache size: 391, Negative cache size: 46, Negative conditional cache size: 10, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 474, independent: 424, independent conditional: 424, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 474, independent: 424, independent conditional: 45, independent unconditional: 379, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 474, independent: 424, independent conditional: 0, independent unconditional: 424, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 424, independent conditional: 0, independent unconditional: 424, dependent: 50, dependent conditional: 0, dependent unconditional: 50, 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: 474, independent: 424, independent conditional: 0, independent unconditional: 424, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 414, Positive conditional cache size: 23, Positive unconditional cache size: 391, Negative cache size: 46, Negative conditional cache size: 10, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 71 PlacesBefore, 71 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 1828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 523, independent: 467, independent conditional: 467, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 523, independent: 467, independent conditional: 49, independent unconditional: 418, dependent: 56, dependent conditional: 16, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 555, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 555, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 226, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 555, independent: 466, independent conditional: 0, independent unconditional: 466, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 415, Positive conditional cache size: 23, Positive unconditional cache size: 392, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.0s, 77 PlacesBefore, 77 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 3008 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 709, independent: 579, independent conditional: 579, independent unconditional: 0, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 709, independent: 579, independent conditional: 91, independent unconditional: 488, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 709, independent: 579, independent conditional: 24, independent unconditional: 555, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 709, independent: 579, independent conditional: 24, independent unconditional: 555, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 709, independent: 568, independent conditional: 16, independent unconditional: 552, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 11, unknown conditional: 8, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 426, Positive conditional cache size: 31, Positive unconditional cache size: 395, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 81 PlacesBefore, 80 PlacesAfterwards, 106 TransitionsBefore, 105 TransitionsAfterwards, 3470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1290, independent: 1112, independent conditional: 1112, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1290, independent: 1112, independent conditional: 522, independent unconditional: 590, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1290, independent: 1112, independent conditional: 360, independent unconditional: 752, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1290, independent: 1112, independent conditional: 360, independent unconditional: 752, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1290, independent: 1107, independent conditional: 355, independent unconditional: 752, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 440, Positive conditional cache size: 36, Positive unconditional cache size: 404, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 162, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 80 PlacesBefore, 80 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 3390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 423, independent: 334, independent conditional: 334, independent unconditional: 0, dependent: 89, dependent conditional: 89, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 423, independent: 334, independent conditional: 27, independent unconditional: 307, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 423, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 423, independent: 334, independent conditional: 0, independent unconditional: 334, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 423, independent: 333, independent conditional: 0, independent unconditional: 333, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 441, Positive conditional cache size: 36, Positive unconditional cache size: 405, Negative cache size: 50, Negative conditional cache size: 10, Negative unconditional cache size: 40, 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: 32.1s, 88 PlacesBefore, 88 PlacesAfterwards, 130 TransitionsBefore, 129 TransitionsAfterwards, 3872 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 301, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 202, dependent conditional: 202, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 301, independent: 99, independent conditional: 35, independent unconditional: 64, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 301, independent: 99, independent conditional: 27, independent unconditional: 72, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 301, independent: 99, independent conditional: 27, independent unconditional: 72, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 301, independent: 93, independent conditional: 22, independent unconditional: 71, dependent: 194, dependent conditional: 0, dependent unconditional: 194, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 447, Positive conditional cache size: 41, Positive unconditional cache size: 406, Negative cache size: 58, Negative conditional cache size: 10, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 93 PlacesBefore, 93 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 4454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 131, independent conditional: 29, independent unconditional: 102, dependent: 52, dependent conditional: 44, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 131, independent conditional: 29, independent unconditional: 102, dependent: 52, dependent conditional: 44, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 131, independent conditional: 29, independent unconditional: 102, dependent: 52, dependent conditional: 44, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 183, independent: 124, independent conditional: 26, independent unconditional: 98, dependent: 48, dependent conditional: 40, dependent unconditional: 8, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 454, Positive conditional cache size: 44, Positive unconditional cache size: 410, Negative cache size: 62, Negative conditional cache size: 14, Negative unconditional cache size: 48, 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.3s, 98 PlacesBefore, 97 PlacesAfterwards, 126 TransitionsBefore, 125 TransitionsAfterwards, 3342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 66, independent conditional: 58, independent unconditional: 8, dependent: 90, dependent conditional: 82, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 66, independent conditional: 58, independent unconditional: 8, dependent: 90, dependent conditional: 82, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 66, independent conditional: 58, independent unconditional: 8, dependent: 90, dependent conditional: 82, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 66, independent conditional: 58, independent unconditional: 8, dependent: 90, dependent conditional: 82, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 460, Positive conditional cache size: 44, Positive unconditional cache size: 416, Negative cache size: 62, Negative conditional cache size: 14, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 92 PlacesBefore, 92 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 3422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 145, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 145, independent: 97, independent conditional: 93, independent unconditional: 4, dependent: 48, dependent conditional: 44, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, independent: 97, independent conditional: 89, independent unconditional: 8, dependent: 92, dependent conditional: 88, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, independent: 97, independent conditional: 89, independent unconditional: 8, dependent: 92, dependent conditional: 88, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 25, independent conditional: 23, independent unconditional: 2, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, independent: 72, independent conditional: 66, independent unconditional: 6, dependent: 88, dependent conditional: 84, dependent unconditional: 4, unknown: 29, unknown conditional: 27, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 551, Positive cache size: 485, Positive conditional cache size: 67, Positive unconditional cache size: 418, Negative cache size: 66, Negative conditional cache size: 18, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 89 PlacesBefore, 85 PlacesAfterwards, 98 TransitionsBefore, 90 TransitionsAfterwards, 2006 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 359, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 359, independent: 297, independent conditional: 241, independent unconditional: 56, dependent: 62, dependent conditional: 60, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 359, independent: 297, independent conditional: 192, independent unconditional: 105, dependent: 62, dependent conditional: 60, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 359, independent: 297, independent conditional: 192, independent unconditional: 105, dependent: 62, dependent conditional: 60, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 88, independent conditional: 54, independent unconditional: 34, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 359, independent: 209, independent conditional: 138, independent unconditional: 71, dependent: 61, dependent conditional: 60, dependent unconditional: 1, unknown: 89, unknown conditional: 54, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 721, Positive cache size: 654, Positive conditional cache size: 124, Positive unconditional cache size: 530, Negative cache size: 67, Negative conditional cache size: 18, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t769, ((void *)0), P0, ((void *)0))=-3, t769={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t770, ((void *)0), P1, ((void *)0))=-2, t769={5:0}, t770={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t771, ((void *)0), P2, ((void *)0))=-1, t769={5:0}, t770={6:0}, t771={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t772, ((void *)0), P3, ((void *)0))=0, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L806] 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) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 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 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 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_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 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) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L786] 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) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 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 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 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_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L842] 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) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 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 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, z=2] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 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 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 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 [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=2, 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: 871]: 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: 865]: 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: 869]: 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: 867]: 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, 167 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: 400.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 321.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 962 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2478 IncrementalHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 20 mSDtfsCounter, 2478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=9, InterpolantAutomatonStates: 65, 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.6s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1363 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-13 00:46:26,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...