/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:20:39,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:20:39,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:20:39,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:20:39,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:20:39,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:20:39,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:20:39,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:20:39,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:20:39,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:20:39,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:20:39,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:20:39,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:20:39,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:20:39,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:20:39,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:20:39,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:20:39,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:20:39,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:20:39,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:20:39,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:20:39,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:20:39,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:20:39,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:20:39,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:20:39,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:20:39,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:20:39,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:20:39,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:20:39,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:20:39,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:20:39,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:20:39,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:20:39,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:20:39,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:20:39,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:20:39,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:20:39,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:20:39,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:20:39,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:20:39,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:20:39,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:20:39,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:20:39,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:20:39,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:20:39,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:20:39,367 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:20:39,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:20:39,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:20:39,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:20:39,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:20:39,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:20:39,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:20:39,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:20:39,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:20:39,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:20:39,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:20:39,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:20:39,371 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:20:39,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:20:39,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:20:39,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:20:39,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:20:39,654 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:20:39,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2022-12-13 09:20:40,754 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:20:41,011 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:20:41,012 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2022-12-13 09:20:41,022 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b193b964/a92c0fc627cb4a24a400bff9f29576ca/FLAG8b9841d36 [2022-12-13 09:20:41,034 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b193b964/a92c0fc627cb4a24a400bff9f29576ca [2022-12-13 09:20:41,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:20:41,036 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:20:41,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:20:41,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:20:41,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:20:41,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc953db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41, skipping insertion in model container [2022-12-13 09:20:41,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:20:41,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:20:41,179 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/mix018_tso.oepc.i[949,962] [2022-12-13 09:20:41,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:20:41,376 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:20:41,383 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/mix018_tso.oepc.i[949,962] [2022-12-13 09:20:41,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:20:41,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:20:41,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:20:41,480 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:20:41,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41 WrapperNode [2022-12-13 09:20:41,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:20:41,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:20:41,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:20:41,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:20:41,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,524 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-13 09:20:41,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:20:41,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:20:41,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:20:41,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:20:41,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,554 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:20:41,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:20:41,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:20:41,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:20:41,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (1/1) ... [2022-12-13 09:20:41,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:20:41,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:20:41,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:20:41,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:20:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:20:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:20:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:20:41,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:20:41,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:20:41,642 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:20:41,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:20:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:20:41,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:20:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:20:41,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:20:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:20:41,643 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:20:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:20:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:20:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:20:41,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:20:41,646 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:20:41,746 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:20:41,747 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:20:42,127 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:20:42,265 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:20:42,265 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:20:42,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:42 BoogieIcfgContainer [2022-12-13 09:20:42,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:20:42,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:20:42,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:20:42,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:20:42,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:20:41" (1/3) ... [2022-12-13 09:20:42,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e352edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:42, skipping insertion in model container [2022-12-13 09:20:42,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:20:41" (2/3) ... [2022-12-13 09:20:42,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e352edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:20:42, skipping insertion in model container [2022-12-13 09:20:42,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:20:42" (3/3) ... [2022-12-13 09:20:42,274 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2022-12-13 09:20:42,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:20:42,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:20:42,288 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:20:42,339 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:20:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 09:20:42,421 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 09:20:42,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:42,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 09:20:42,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-13 09:20:42,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-13 09:20:42,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:42,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 09:20:42,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-13 09:20:42,491 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 09:20:42,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:42,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-13 09:20:42,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-13 09:20:42,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 3150 [2022-12-13 09:20:52,153 INFO L241 LiptonReduction]: Total number of compositions: 98 [2022-12-13 09:20:52,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:20:52,170 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;@46a5c06a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:20:52,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:20:52,173 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-13 09:20:52,173 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:52,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:52,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:20:52,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:20:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash 540957260, now seen corresponding path program 1 times [2022-12-13 09:20:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:52,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153719007] [2022-12-13 09:20:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153719007] [2022-12-13 09:20:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153719007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:52,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:52,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881932081] [2022-12-13 09:20:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:52,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:52,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:52,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 79 [2022-12-13 09:20:52,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:52,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:52,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 79 [2022-12-13 09:20:52,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:00,172 INFO L130 PetriNetUnfolder]: 57424/81317 cut-off events. [2022-12-13 09:21:00,172 INFO L131 PetriNetUnfolder]: For 146/146 co-relation queries the response was YES. [2022-12-13 09:21:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157470 conditions, 81317 events. 57424/81317 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 4058. Compared 592700 event pairs, 22678 based on Foata normal form. 0/50894 useless extension candidates. Maximal degree in co-relation 157458. Up to 63597 conditions per place. [2022-12-13 09:21:00,536 INFO L137 encePairwiseOnDemand]: 73/79 looper letters, 44 selfloop transitions, 2 changer transitions 64/126 dead transitions. [2022-12-13 09:21:00,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 490 flow [2022-12-13 09:21:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:21:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:21:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-12-13 09:21:00,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6962025316455697 [2022-12-13 09:21:00,548 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 170 flow. Second operand 3 states and 165 transitions. [2022-12-13 09:21:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 490 flow [2022-12-13 09:21:00,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 484 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:21:00,554 INFO L231 Difference]: Finished difference. Result has 86 places, 43 transitions, 98 flow [2022-12-13 09:21:00,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=86, PETRI_TRANSITIONS=43} [2022-12-13 09:21:00,558 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2022-12-13 09:21:00,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:00,559 INFO L89 Accepts]: Start accepts. Operand has 86 places, 43 transitions, 98 flow [2022-12-13 09:21:00,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:00,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:00,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 43 transitions, 98 flow [2022-12-13 09:21:00,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2022-12-13 09:21:00,576 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 09:21:00,576 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:21:00,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 118 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 09:21:00,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2022-12-13 09:21:00,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 1100 [2022-12-13 09:21:00,730 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:00,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-13 09:21:00,732 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 98 flow [2022-12-13 09:21:00,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:00,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:00,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:00,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:21:00,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1560289086, now seen corresponding path program 1 times [2022-12-13 09:21:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246965040] [2022-12-13 09:21:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:01,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:01,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246965040] [2022-12-13 09:21:01,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246965040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:01,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:21:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451793019] [2022-12-13 09:21:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:21:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:21:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:21:01,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:21:01,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:01,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:01,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:21:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:02,991 INFO L130 PetriNetUnfolder]: 18491/25685 cut-off events. [2022-12-13 09:21:02,992 INFO L131 PetriNetUnfolder]: For 1018/1018 co-relation queries the response was YES. [2022-12-13 09:21:03,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51851 conditions, 25685 events. 18491/25685 cut-off events. For 1018/1018 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 140164 event pairs, 5531 based on Foata normal form. 432/22203 useless extension candidates. Maximal degree in co-relation 51841. Up to 18145 conditions per place. [2022-12-13 09:21:03,147 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 47 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-12-13 09:21:03,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 232 flow [2022-12-13 09:21:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:21:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:21:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 09:21:03,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2022-12-13 09:21:03,149 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 98 flow. Second operand 3 states and 83 transitions. [2022-12-13 09:21:03,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 232 flow [2022-12-13 09:21:03,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:21:03,152 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 102 flow [2022-12-13 09:21:03,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 09:21:03,153 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -36 predicate places. [2022-12-13 09:21:03,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:03,153 INFO L89 Accepts]: Start accepts. Operand has 55 places, 43 transitions, 102 flow [2022-12-13 09:21:03,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:03,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:03,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 43 transitions, 102 flow [2022-12-13 09:21:03,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 102 flow [2022-12-13 09:21:03,158 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 09:21:03,159 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:21:03,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:21:03,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 102 flow [2022-12-13 09:21:03,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 1094 [2022-12-13 09:21:03,217 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:03,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 09:21:03,219 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 100 flow [2022-12-13 09:21:03,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:03,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:03,220 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:03,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:21:03,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1123395189, now seen corresponding path program 1 times [2022-12-13 09:21:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:03,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308221401] [2022-12-13 09:21:03,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:03,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:03,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308221401] [2022-12-13 09:21:03,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308221401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:03,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:03,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:21:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549805236] [2022-12-13 09:21:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:03,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:21:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:21:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:21:03,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2022-12-13 09:21:03,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 100 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 09:21:03,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:03,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2022-12-13 09:21:03,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:05,248 INFO L130 PetriNetUnfolder]: 16587/23069 cut-off events. [2022-12-13 09:21:05,248 INFO L131 PetriNetUnfolder]: For 1740/1740 co-relation queries the response was YES. [2022-12-13 09:21:05,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48068 conditions, 23069 events. 16587/23069 cut-off events. For 1740/1740 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 133383 event pairs, 2835 based on Foata normal form. 90/19553 useless extension candidates. Maximal degree in co-relation 48057. Up to 21171 conditions per place. [2022-12-13 09:21:05,404 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 61 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2022-12-13 09:21:05,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 344 flow [2022-12-13 09:21:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-12-13 09:21:05,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2022-12-13 09:21:05,405 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 100 flow. Second operand 4 states and 118 transitions. [2022-12-13 09:21:05,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 344 flow [2022-12-13 09:21:05,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:21:05,410 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 173 flow [2022-12-13 09:21:05,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2022-12-13 09:21:05,411 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -34 predicate places. [2022-12-13 09:21:05,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:05,411 INFO L89 Accepts]: Start accepts. Operand has 57 places, 52 transitions, 173 flow [2022-12-13 09:21:05,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:05,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:05,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 52 transitions, 173 flow [2022-12-13 09:21:05,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 52 transitions, 173 flow [2022-12-13 09:21:05,460 INFO L130 PetriNetUnfolder]: 348/753 cut-off events. [2022-12-13 09:21:05,460 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-13 09:21:05,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 753 events. 348/753 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4727 event pairs, 250 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 1537. Up to 492 conditions per place. [2022-12-13 09:21:05,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 52 transitions, 173 flow [2022-12-13 09:21:05,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 1256 [2022-12-13 09:21:05,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [571] $Ultimate##0-->L826: Formula: (and (= v_~z~0_44 1) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_13|) (= v_~z~0_44 v_~__unbuffered_p3_EAX~0_117) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_13|)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_13|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_13|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~z~0=v_~z~0_44, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_13|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] [2022-12-13 09:21:05,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [395] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_52)) v_~x~0_51) (= (ite .cse0 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_100 256) 0)))) 0 v_~x$r_buff1_thd3~0_22) v_~x$r_buff1_thd3~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:21:05,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [402] L826-->L829: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] [2022-12-13 09:21:05,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [352] L865-->L871: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd0~0_58 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_60 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_140 256) 0)) .cse5)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= 0 (mod v_~x$w_buff1_used~0_119 256))) .cse4))) (and (= (ite .cse0 0 v_~x$r_buff0_thd0~0_60) v_~x$r_buff0_thd0~0_59) (= v_~x~0_73 (ite .cse1 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_51 v_~x~0_74))) (= (ite .cse1 0 v_~x$w_buff0_used~0_140) v_~x$w_buff0_used~0_139) (= v_~x$r_buff1_thd0~0_57 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_118 256) 0)))) 0 v_~x$r_buff1_thd0~0_58)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_119) v_~x$w_buff1_used~0_118)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_119, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_58, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_140} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_118, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_57, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_139} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:21:05,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [394] L803-->L806: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 09:21:05,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [472] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (= v_~x$w_buff0_used~0_238 v_~x$w_buff1_used~0_203) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_237 256) 0)) (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_61) (= v_~x$w_buff0_used~0_237 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_238, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_237, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-13 09:21:05,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L753-->L756: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [403] L829-->L836: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse2)) (.cse4 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5))) (and (= v_~x$w_buff1_used~0_126 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_127)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$r_buff0_thd4~0_21 (ite .cse1 0 v_~x$r_buff0_thd4~0_22)) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_58 (ite .cse0 v_~x$w_buff1~0_55 v_~x~0_82))) (= (ite .cse4 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 09:21:05,953 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:05,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 542 [2022-12-13 09:21:05,954 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 197 flow [2022-12-13 09:21:05,954 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 09:21:05,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:05,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:05,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:21:05,954 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash -465513759, now seen corresponding path program 1 times [2022-12-13 09:21:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285829217] [2022-12-13 09:21:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:05,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:06,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285829217] [2022-12-13 09:21:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285829217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:06,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8957156] [2022-12-13 09:21:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:06,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:06,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:06,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:06,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2022-12-13 09:21:06,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:06,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:06,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2022-12-13 09:21:06,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:08,584 INFO L130 PetriNetUnfolder]: 16759/23565 cut-off events. [2022-12-13 09:21:08,584 INFO L131 PetriNetUnfolder]: For 11914/11914 co-relation queries the response was YES. [2022-12-13 09:21:08,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59888 conditions, 23565 events. 16759/23565 cut-off events. For 11914/11914 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 134315 event pairs, 6677 based on Foata normal form. 24/20021 useless extension candidates. Maximal degree in co-relation 59875. Up to 21750 conditions per place. [2022-12-13 09:21:08,775 INFO L137 encePairwiseOnDemand]: 31/50 looper letters, 61 selfloop transitions, 20 changer transitions 0/92 dead transitions. [2022-12-13 09:21:08,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 541 flow [2022-12-13 09:21:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-12-13 09:21:08,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 09:21:08,777 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 197 flow. Second operand 4 states and 125 transitions. [2022-12-13 09:21:08,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 541 flow [2022-12-13 09:21:08,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 541 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:21:08,782 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 414 flow [2022-12-13 09:21:08,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2022-12-13 09:21:08,783 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -30 predicate places. [2022-12-13 09:21:08,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:08,783 INFO L89 Accepts]: Start accepts. Operand has 61 places, 70 transitions, 414 flow [2022-12-13 09:21:08,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:08,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:08,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 70 transitions, 414 flow [2022-12-13 09:21:08,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 70 transitions, 414 flow [2022-12-13 09:21:08,878 INFO L130 PetriNetUnfolder]: 715/1394 cut-off events. [2022-12-13 09:21:08,878 INFO L131 PetriNetUnfolder]: For 1032/1177 co-relation queries the response was YES. [2022-12-13 09:21:08,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4012 conditions, 1394 events. 715/1394 cut-off events. For 1032/1177 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9244 event pairs, 328 based on Foata normal form. 3/1147 useless extension candidates. Maximal degree in co-relation 3998. Up to 854 conditions per place. [2022-12-13 09:21:08,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 70 transitions, 414 flow [2022-12-13 09:21:08,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 1496 [2022-12-13 09:21:08,913 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:08,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 09:21:08,915 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 414 flow [2022-12-13 09:21:08,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:08,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:08,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:08,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:21:08,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1330850087, now seen corresponding path program 1 times [2022-12-13 09:21:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:08,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820743906] [2022-12-13 09:21:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:08,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:09,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820743906] [2022-12-13 09:21:09,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820743906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:09,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:09,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367621737] [2022-12-13 09:21:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:09,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:09,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2022-12-13 09:21:09,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 414 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:09,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:09,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2022-12-13 09:21:09,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:11,255 INFO L130 PetriNetUnfolder]: 15370/21580 cut-off events. [2022-12-13 09:21:11,255 INFO L131 PetriNetUnfolder]: For 29939/31384 co-relation queries the response was YES. [2022-12-13 09:21:11,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65125 conditions, 21580 events. 15370/21580 cut-off events. For 29939/31384 co-relation queries the response was YES. Maximal size of possible extension queue 981. Compared 125757 event pairs, 6096 based on Foata normal form. 39/17421 useless extension candidates. Maximal degree in co-relation 65108. Up to 16873 conditions per place. [2022-12-13 09:21:11,382 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 70 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2022-12-13 09:21:11,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 756 flow [2022-12-13 09:21:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-12-13 09:21:11,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.63 [2022-12-13 09:21:11,383 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 414 flow. Second operand 4 states and 126 transitions. [2022-12-13 09:21:11,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 756 flow [2022-12-13 09:21:11,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 108 transitions, 732 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-13 09:21:11,392 INFO L231 Difference]: Finished difference. Result has 65 places, 77 transitions, 508 flow [2022-12-13 09:21:11,392 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=508, PETRI_PLACES=65, PETRI_TRANSITIONS=77} [2022-12-13 09:21:11,393 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -26 predicate places. [2022-12-13 09:21:11,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:11,393 INFO L89 Accepts]: Start accepts. Operand has 65 places, 77 transitions, 508 flow [2022-12-13 09:21:11,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:11,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:11,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 77 transitions, 508 flow [2022-12-13 09:21:11,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 77 transitions, 508 flow [2022-12-13 09:21:11,523 INFO L130 PetriNetUnfolder]: 747/1422 cut-off events. [2022-12-13 09:21:11,523 INFO L131 PetriNetUnfolder]: For 1836/1940 co-relation queries the response was YES. [2022-12-13 09:21:11,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4529 conditions, 1422 events. 747/1422 cut-off events. For 1836/1940 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9173 event pairs, 326 based on Foata normal form. 3/1181 useless extension candidates. Maximal degree in co-relation 4512. Up to 748 conditions per place. [2022-12-13 09:21:11,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 77 transitions, 508 flow [2022-12-13 09:21:11,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 1616 [2022-12-13 09:21:11,562 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:11,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 09:21:11,564 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 77 transitions, 508 flow [2022-12-13 09:21:11,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:11,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:11,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:11,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:21:11,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash -465402159, now seen corresponding path program 2 times [2022-12-13 09:21:11,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:11,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282519620] [2022-12-13 09:21:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:11,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:11,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282519620] [2022-12-13 09:21:11,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282519620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:11,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:11,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:11,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350309997] [2022-12-13 09:21:11,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:11,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:11,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2022-12-13 09:21:11,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 77 transitions, 508 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:11,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:11,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2022-12-13 09:21:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:13,806 INFO L130 PetriNetUnfolder]: 15249/21566 cut-off events. [2022-12-13 09:21:13,806 INFO L131 PetriNetUnfolder]: For 36362/36968 co-relation queries the response was YES. [2022-12-13 09:21:13,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68506 conditions, 21566 events. 15249/21566 cut-off events. For 36362/36968 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 125125 event pairs, 8003 based on Foata normal form. 24/17707 useless extension candidates. Maximal degree in co-relation 68486. Up to 18711 conditions per place. [2022-12-13 09:21:13,949 INFO L137 encePairwiseOnDemand]: 34/50 looper letters, 79 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2022-12-13 09:21:13,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 942 flow [2022-12-13 09:21:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-13 09:21:13,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 09:21:13,952 INFO L175 Difference]: Start difference. First operand has 65 places, 77 transitions, 508 flow. Second operand 4 states and 128 transitions. [2022-12-13 09:21:13,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 942 flow [2022-12-13 09:21:13,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 931 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 09:21:13,965 INFO L231 Difference]: Finished difference. Result has 69 places, 94 transitions, 756 flow [2022-12-13 09:21:13,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=756, PETRI_PLACES=69, PETRI_TRANSITIONS=94} [2022-12-13 09:21:13,967 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -22 predicate places. [2022-12-13 09:21:13,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:13,967 INFO L89 Accepts]: Start accepts. Operand has 69 places, 94 transitions, 756 flow [2022-12-13 09:21:13,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:13,968 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:13,968 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 94 transitions, 756 flow [2022-12-13 09:21:13,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 94 transitions, 756 flow [2022-12-13 09:21:14,111 INFO L130 PetriNetUnfolder]: 954/1774 cut-off events. [2022-12-13 09:21:14,111 INFO L131 PetriNetUnfolder]: For 3578/3762 co-relation queries the response was YES. [2022-12-13 09:21:14,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6222 conditions, 1774 events. 954/1774 cut-off events. For 3578/3762 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11299 event pairs, 387 based on Foata normal form. 5/1439 useless extension candidates. Maximal degree in co-relation 6202. Up to 943 conditions per place. [2022-12-13 09:21:14,129 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 94 transitions, 756 flow [2022-12-13 09:21:14,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 1814 [2022-12-13 09:21:14,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (= v_~x$w_buff0_used~0_238 v_~x$w_buff1_used~0_203) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_237 256) 0)) (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_61) (= v_~x$w_buff0_used~0_237 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_238, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_237, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] and [395] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_52)) v_~x~0_51) (= (ite .cse0 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_100 256) 0)))) 0 v_~x$r_buff1_thd3~0_22) v_~x$r_buff1_thd3~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:21:14,315 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (= v_~x$w_buff0_used~0_238 v_~x$w_buff1_used~0_203) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_237 256) 0)) (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_61) (= v_~x$w_buff0_used~0_237 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_238, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_237, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] and [403] L829-->L836: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse2)) (.cse4 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5))) (and (= v_~x$w_buff1_used~0_126 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_127)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$r_buff0_thd4~0_21 (ite .cse1 0 v_~x$r_buff0_thd4~0_22)) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_58 (ite .cse0 v_~x$w_buff1~0_55 v_~x~0_82))) (= (ite .cse4 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 09:21:14,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:14,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 586 [2022-12-13 09:21:14,553 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 94 transitions, 776 flow [2022-12-13 09:21:14,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:14,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:14,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:14,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:21:14,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:14,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash -494262849, now seen corresponding path program 3 times [2022-12-13 09:21:14,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:14,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613582427] [2022-12-13 09:21:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:14,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 09:21:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:14,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613582427] [2022-12-13 09:21:14,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613582427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:14,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:14,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:14,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961048265] [2022-12-13 09:21:14,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:14,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:14,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:14,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:14,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2022-12-13 09:21:14,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 94 transitions, 776 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:14,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:14,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2022-12-13 09:21:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:16,711 INFO L130 PetriNetUnfolder]: 15774/22252 cut-off events. [2022-12-13 09:21:16,712 INFO L131 PetriNetUnfolder]: For 57358/58247 co-relation queries the response was YES. [2022-12-13 09:21:16,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76753 conditions, 22252 events. 15774/22252 cut-off events. For 57358/58247 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 129779 event pairs, 8257 based on Foata normal form. 176/18401 useless extension candidates. Maximal degree in co-relation 76730. Up to 18116 conditions per place. [2022-12-13 09:21:16,840 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 76 selfloop transitions, 39 changer transitions 0/132 dead transitions. [2022-12-13 09:21:16,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 1173 flow [2022-12-13 09:21:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2022-12-13 09:21:16,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 09:21:16,842 INFO L175 Difference]: Start difference. First operand has 69 places, 94 transitions, 776 flow. Second operand 4 states and 130 transitions. [2022-12-13 09:21:16,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 132 transitions, 1173 flow [2022-12-13 09:21:16,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 1141 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 09:21:16,869 INFO L231 Difference]: Finished difference. Result has 72 places, 100 transitions, 897 flow [2022-12-13 09:21:16,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=897, PETRI_PLACES=72, PETRI_TRANSITIONS=100} [2022-12-13 09:21:16,870 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -19 predicate places. [2022-12-13 09:21:16,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:16,870 INFO L89 Accepts]: Start accepts. Operand has 72 places, 100 transitions, 897 flow [2022-12-13 09:21:16,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:16,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:16,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 100 transitions, 897 flow [2022-12-13 09:21:16,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 100 transitions, 897 flow [2022-12-13 09:21:16,999 INFO L130 PetriNetUnfolder]: 927/1826 cut-off events. [2022-12-13 09:21:17,000 INFO L131 PetriNetUnfolder]: For 5300/5553 co-relation queries the response was YES. [2022-12-13 09:21:17,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6847 conditions, 1826 events. 927/1826 cut-off events. For 5300/5553 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 12578 event pairs, 390 based on Foata normal form. 16/1476 useless extension candidates. Maximal degree in co-relation 6825. Up to 932 conditions per place. [2022-12-13 09:21:17,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 100 transitions, 897 flow [2022-12-13 09:21:17,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 1932 [2022-12-13 09:21:17,020 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:17,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 09:21:17,021 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 100 transitions, 897 flow [2022-12-13 09:21:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:17,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:17,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:17,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:21:17,021 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1670794606, now seen corresponding path program 1 times [2022-12-13 09:21:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:17,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161753469] [2022-12-13 09:21:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:17,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161753469] [2022-12-13 09:21:17,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161753469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:17,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:17,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431803395] [2022-12-13 09:21:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:17,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:17,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2022-12-13 09:21:17,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 100 transitions, 897 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:17,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:17,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2022-12-13 09:21:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:19,961 INFO L130 PetriNetUnfolder]: 17596/24196 cut-off events. [2022-12-13 09:21:19,961 INFO L131 PetriNetUnfolder]: For 62351/62351 co-relation queries the response was YES. [2022-12-13 09:21:20,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87740 conditions, 24196 events. 17596/24196 cut-off events. For 62351/62351 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 130545 event pairs, 5989 based on Foata normal form. 114/20646 useless extension candidates. Maximal degree in co-relation 87715. Up to 20809 conditions per place. [2022-12-13 09:21:20,146 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 106 selfloop transitions, 44 changer transitions 0/161 dead transitions. [2022-12-13 09:21:20,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 161 transitions, 1619 flow [2022-12-13 09:21:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:21:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:21:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2022-12-13 09:21:20,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2022-12-13 09:21:20,148 INFO L175 Difference]: Start difference. First operand has 72 places, 100 transitions, 897 flow. Second operand 5 states and 150 transitions. [2022-12-13 09:21:20,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 161 transitions, 1619 flow [2022-12-13 09:21:20,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 161 transitions, 1502 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 09:21:20,207 INFO L231 Difference]: Finished difference. Result has 76 places, 113 transitions, 1136 flow [2022-12-13 09:21:20,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1136, PETRI_PLACES=76, PETRI_TRANSITIONS=113} [2022-12-13 09:21:20,209 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -15 predicate places. [2022-12-13 09:21:20,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:20,209 INFO L89 Accepts]: Start accepts. Operand has 76 places, 113 transitions, 1136 flow [2022-12-13 09:21:20,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:20,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:20,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 113 transitions, 1136 flow [2022-12-13 09:21:20,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 113 transitions, 1136 flow [2022-12-13 09:21:20,386 INFO L130 PetriNetUnfolder]: 893/1786 cut-off events. [2022-12-13 09:21:20,386 INFO L131 PetriNetUnfolder]: For 5067/5275 co-relation queries the response was YES. [2022-12-13 09:21:20,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 1786 events. 893/1786 cut-off events. For 5067/5275 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12529 event pairs, 326 based on Foata normal form. 15/1435 useless extension candidates. Maximal degree in co-relation 6449. Up to 900 conditions per place. [2022-12-13 09:21:20,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 113 transitions, 1136 flow [2022-12-13 09:21:20,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 2062 [2022-12-13 09:21:20,504 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:20,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 295 [2022-12-13 09:21:20,504 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 113 transitions, 1136 flow [2022-12-13 09:21:20,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:20,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:20,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:20,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:21:20,505 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1692965837, now seen corresponding path program 1 times [2022-12-13 09:21:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:20,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182013857] [2022-12-13 09:21:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182013857] [2022-12-13 09:21:20,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182013857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:20,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:20,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:20,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586483076] [2022-12-13 09:21:20,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:20,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:20,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:20,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2022-12-13 09:21:20,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 113 transitions, 1136 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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 09:21:20,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:20,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2022-12-13 09:21:20,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:22,800 INFO L130 PetriNetUnfolder]: 16214/22926 cut-off events. [2022-12-13 09:21:22,800 INFO L131 PetriNetUnfolder]: For 69657/70495 co-relation queries the response was YES. [2022-12-13 09:21:22,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82771 conditions, 22926 events. 16214/22926 cut-off events. For 69657/70495 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 135392 event pairs, 5394 based on Foata normal form. 104/19134 useless extension candidates. Maximal degree in co-relation 82744. Up to 17404 conditions per place. [2022-12-13 09:21:22,985 INFO L137 encePairwiseOnDemand]: 42/52 looper letters, 114 selfloop transitions, 22 changer transitions 0/154 dead transitions. [2022-12-13 09:21:22,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 154 transitions, 1603 flow [2022-12-13 09:21:22,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-13 09:21:22,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6201923076923077 [2022-12-13 09:21:22,986 INFO L175 Difference]: Start difference. First operand has 76 places, 113 transitions, 1136 flow. Second operand 4 states and 129 transitions. [2022-12-13 09:21:22,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 154 transitions, 1603 flow [2022-12-13 09:21:23,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 154 transitions, 1506 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 09:21:23,008 INFO L231 Difference]: Finished difference. Result has 77 places, 120 transitions, 1168 flow [2022-12-13 09:21:23,008 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1168, PETRI_PLACES=77, PETRI_TRANSITIONS=120} [2022-12-13 09:21:23,009 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -14 predicate places. [2022-12-13 09:21:23,009 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:23,009 INFO L89 Accepts]: Start accepts. Operand has 77 places, 120 transitions, 1168 flow [2022-12-13 09:21:23,009 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:23,009 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:23,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 120 transitions, 1168 flow [2022-12-13 09:21:23,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 120 transitions, 1168 flow [2022-12-13 09:21:23,171 INFO L130 PetriNetUnfolder]: 1141/2094 cut-off events. [2022-12-13 09:21:23,171 INFO L131 PetriNetUnfolder]: For 6976/7273 co-relation queries the response was YES. [2022-12-13 09:21:23,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8337 conditions, 2094 events. 1141/2094 cut-off events. For 6976/7273 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 13858 event pairs, 326 based on Foata normal form. 25/1744 useless extension candidates. Maximal degree in co-relation 8313. Up to 1128 conditions per place. [2022-12-13 09:21:23,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 120 transitions, 1168 flow [2022-12-13 09:21:23,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 2214 [2022-12-13 09:21:23,198 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:23,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-13 09:21:23,198 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 120 transitions, 1168 flow [2022-12-13 09:21:23,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 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 09:21:23,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:23,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:21:23,199 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1693209931, now seen corresponding path program 1 times [2022-12-13 09:21:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:23,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981558766] [2022-12-13 09:21:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981558766] [2022-12-13 09:21:23,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981558766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:23,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:23,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:21:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138556422] [2022-12-13 09:21:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:23,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:21:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:23,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:21:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:21:23,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2022-12-13 09:21:23,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 120 transitions, 1168 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 09:21:23,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:23,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2022-12-13 09:21:23,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:26,208 INFO L130 PetriNetUnfolder]: 17908/25457 cut-off events. [2022-12-13 09:21:26,209 INFO L131 PetriNetUnfolder]: For 102325/103502 co-relation queries the response was YES. [2022-12-13 09:21:26,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96332 conditions, 25457 events. 17908/25457 cut-off events. For 102325/103502 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 156956 event pairs, 4577 based on Foata normal form. 413/21623 useless extension candidates. Maximal degree in co-relation 96305. Up to 16684 conditions per place. [2022-12-13 09:21:26,404 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 93 selfloop transitions, 64 changer transitions 0/175 dead transitions. [2022-12-13 09:21:26,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 175 transitions, 1732 flow [2022-12-13 09:21:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:21:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:21:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2022-12-13 09:21:26,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2022-12-13 09:21:26,405 INFO L175 Difference]: Start difference. First operand has 77 places, 120 transitions, 1168 flow. Second operand 5 states and 164 transitions. [2022-12-13 09:21:26,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 175 transitions, 1732 flow [2022-12-13 09:21:26,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 175 transitions, 1678 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 09:21:26,476 INFO L231 Difference]: Finished difference. Result has 80 places, 124 transitions, 1326 flow [2022-12-13 09:21:26,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1326, PETRI_PLACES=80, PETRI_TRANSITIONS=124} [2022-12-13 09:21:26,477 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -11 predicate places. [2022-12-13 09:21:26,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:26,477 INFO L89 Accepts]: Start accepts. Operand has 80 places, 124 transitions, 1326 flow [2022-12-13 09:21:26,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:26,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:26,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 124 transitions, 1326 flow [2022-12-13 09:21:26,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 124 transitions, 1326 flow [2022-12-13 09:21:26,649 INFO L130 PetriNetUnfolder]: 1198/2192 cut-off events. [2022-12-13 09:21:26,649 INFO L131 PetriNetUnfolder]: For 9662/10118 co-relation queries the response was YES. [2022-12-13 09:21:26,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9599 conditions, 2192 events. 1198/2192 cut-off events. For 9662/10118 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14734 event pairs, 331 based on Foata normal form. 86/1939 useless extension candidates. Maximal degree in co-relation 9574. Up to 1180 conditions per place. [2022-12-13 09:21:26,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 124 transitions, 1326 flow [2022-12-13 09:21:26,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 2338 [2022-12-13 09:21:26,678 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:26,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 09:21:26,679 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 124 transitions, 1326 flow [2022-12-13 09:21:26,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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 09:21:26,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:26,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:26,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:21:26,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1544435330, now seen corresponding path program 1 times [2022-12-13 09:21:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100683354] [2022-12-13 09:21:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:27,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100683354] [2022-12-13 09:21:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100683354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:27,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:27,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532611052] [2022-12-13 09:21:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:27,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:27,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2022-12-13 09:21:27,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 124 transitions, 1326 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:27,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:27,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2022-12-13 09:21:27,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:29,547 INFO L130 PetriNetUnfolder]: 18438/26055 cut-off events. [2022-12-13 09:21:29,547 INFO L131 PetriNetUnfolder]: For 115312/116173 co-relation queries the response was YES. [2022-12-13 09:21:29,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105907 conditions, 26055 events. 18438/26055 cut-off events. For 115312/116173 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 155644 event pairs, 8870 based on Foata normal form. 277/21965 useless extension candidates. Maximal degree in co-relation 105879. Up to 21936 conditions per place. [2022-12-13 09:21:29,799 INFO L137 encePairwiseOnDemand]: 33/52 looper letters, 115 selfloop transitions, 47 changer transitions 0/180 dead transitions. [2022-12-13 09:21:29,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 180 transitions, 2015 flow [2022-12-13 09:21:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:21:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:21:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-12-13 09:21:29,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6192307692307693 [2022-12-13 09:21:29,801 INFO L175 Difference]: Start difference. First operand has 80 places, 124 transitions, 1326 flow. Second operand 5 states and 161 transitions. [2022-12-13 09:21:29,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 180 transitions, 2015 flow [2022-12-13 09:21:29,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 180 transitions, 1863 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 09:21:29,931 INFO L231 Difference]: Finished difference. Result has 83 places, 146 transitions, 1582 flow [2022-12-13 09:21:29,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1582, PETRI_PLACES=83, PETRI_TRANSITIONS=146} [2022-12-13 09:21:29,931 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -8 predicate places. [2022-12-13 09:21:29,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:29,932 INFO L89 Accepts]: Start accepts. Operand has 83 places, 146 transitions, 1582 flow [2022-12-13 09:21:29,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:29,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:29,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 146 transitions, 1582 flow [2022-12-13 09:21:29,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 146 transitions, 1582 flow [2022-12-13 09:21:30,281 INFO L130 PetriNetUnfolder]: 1297/2297 cut-off events. [2022-12-13 09:21:30,281 INFO L131 PetriNetUnfolder]: For 10925/11535 co-relation queries the response was YES. [2022-12-13 09:21:30,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10323 conditions, 2297 events. 1297/2297 cut-off events. For 10925/11535 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 15036 event pairs, 347 based on Foata normal form. 153/2117 useless extension candidates. Maximal degree in co-relation 10296. Up to 1256 conditions per place. [2022-12-13 09:21:30,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 146 transitions, 1582 flow [2022-12-13 09:21:30,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 2618 [2022-12-13 09:21:30,314 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:30,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-13 09:21:30,315 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 146 transitions, 1582 flow [2022-12-13 09:21:30,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:30,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:30,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:30,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:21:30,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -947818005, now seen corresponding path program 1 times [2022-12-13 09:21:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:30,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448114198] [2022-12-13 09:21:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448114198] [2022-12-13 09:21:30,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448114198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:30,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:30,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903092372] [2022-12-13 09:21:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:30,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:30,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:30,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:30,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2022-12-13 09:21:30,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 146 transitions, 1582 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:30,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:30,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2022-12-13 09:21:30,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:33,443 INFO L130 PetriNetUnfolder]: 19517/28167 cut-off events. [2022-12-13 09:21:33,444 INFO L131 PetriNetUnfolder]: For 147582/149630 co-relation queries the response was YES. [2022-12-13 09:21:33,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115120 conditions, 28167 events. 19517/28167 cut-off events. For 147582/149630 co-relation queries the response was YES. Maximal size of possible extension queue 1250. Compared 183140 event pairs, 4365 based on Foata normal form. 920/24423 useless extension candidates. Maximal degree in co-relation 115090. Up to 16651 conditions per place. [2022-12-13 09:21:33,726 INFO L137 encePairwiseOnDemand]: 43/52 looper letters, 121 selfloop transitions, 46 changer transitions 0/185 dead transitions. [2022-12-13 09:21:33,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 185 transitions, 2110 flow [2022-12-13 09:21:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-12-13 09:21:33,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6394230769230769 [2022-12-13 09:21:33,728 INFO L175 Difference]: Start difference. First operand has 83 places, 146 transitions, 1582 flow. Second operand 4 states and 133 transitions. [2022-12-13 09:21:33,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 185 transitions, 2110 flow [2022-12-13 09:21:33,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 185 transitions, 2063 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 09:21:33,863 INFO L231 Difference]: Finished difference. Result has 86 places, 149 transitions, 1714 flow [2022-12-13 09:21:33,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1714, PETRI_PLACES=86, PETRI_TRANSITIONS=149} [2022-12-13 09:21:33,864 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2022-12-13 09:21:33,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:33,864 INFO L89 Accepts]: Start accepts. Operand has 86 places, 149 transitions, 1714 flow [2022-12-13 09:21:33,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:33,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:33,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 149 transitions, 1714 flow [2022-12-13 09:21:33,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 149 transitions, 1714 flow [2022-12-13 09:21:34,070 INFO L130 PetriNetUnfolder]: 1305/2363 cut-off events. [2022-12-13 09:21:34,070 INFO L131 PetriNetUnfolder]: For 12865/13514 co-relation queries the response was YES. [2022-12-13 09:21:34,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11208 conditions, 2363 events. 1305/2363 cut-off events. For 12865/13514 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 15907 event pairs, 371 based on Foata normal form. 200/2202 useless extension candidates. Maximal degree in co-relation 11179. Up to 1263 conditions per place. [2022-12-13 09:21:34,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 149 transitions, 1714 flow [2022-12-13 09:21:34,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 2708 [2022-12-13 09:21:34,110 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:34,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-13 09:21:34,111 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 149 transitions, 1714 flow [2022-12-13 09:21:34,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:34,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:34,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:34,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:21:34,111 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash 816645006, now seen corresponding path program 1 times [2022-12-13 09:21:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:34,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508901537] [2022-12-13 09:21:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:34,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:34,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508901537] [2022-12-13 09:21:34,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508901537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:34,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:34,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:21:34,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919596923] [2022-12-13 09:21:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:34,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:21:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:21:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:21:34,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2022-12-13 09:21:34,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 149 transitions, 1714 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:34,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:34,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2022-12-13 09:21:34,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:38,627 INFO L130 PetriNetUnfolder]: 30414/42071 cut-off events. [2022-12-13 09:21:38,627 INFO L131 PetriNetUnfolder]: For 277495/281088 co-relation queries the response was YES. [2022-12-13 09:21:38,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179865 conditions, 42071 events. 30414/42071 cut-off events. For 277495/281088 co-relation queries the response was YES. Maximal size of possible extension queue 1878. Compared 259673 event pairs, 10694 based on Foata normal form. 409/29442 useless extension candidates. Maximal degree in co-relation 179833. Up to 38479 conditions per place. [2022-12-13 09:21:38,992 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 150 selfloop transitions, 13 changer transitions 0/181 dead transitions. [2022-12-13 09:21:38,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 181 transitions, 2166 flow [2022-12-13 09:21:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:21:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:21:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-12-13 09:21:38,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 09:21:38,993 INFO L175 Difference]: Start difference. First operand has 86 places, 149 transitions, 1714 flow. Second operand 3 states and 108 transitions. [2022-12-13 09:21:38,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 181 transitions, 2166 flow [2022-12-13 09:21:39,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 181 transitions, 2047 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 09:21:39,252 INFO L231 Difference]: Finished difference. Result has 85 places, 136 transitions, 1316 flow [2022-12-13 09:21:39,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=85, PETRI_TRANSITIONS=136} [2022-12-13 09:21:39,253 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2022-12-13 09:21:39,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:39,253 INFO L89 Accepts]: Start accepts. Operand has 85 places, 136 transitions, 1316 flow [2022-12-13 09:21:39,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:39,254 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:39,254 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 136 transitions, 1316 flow [2022-12-13 09:21:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 136 transitions, 1316 flow [2022-12-13 09:21:40,611 INFO L130 PetriNetUnfolder]: 10064/16438 cut-off events. [2022-12-13 09:21:40,612 INFO L131 PetriNetUnfolder]: For 51804/53428 co-relation queries the response was YES. [2022-12-13 09:21:40,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59021 conditions, 16438 events. 10064/16438 cut-off events. For 51804/53428 co-relation queries the response was YES. Maximal size of possible extension queue 1931. Compared 139558 event pairs, 5492 based on Foata normal form. 311/10160 useless extension candidates. Maximal degree in co-relation 58993. Up to 9166 conditions per place. [2022-12-13 09:21:40,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 136 transitions, 1316 flow [2022-12-13 09:21:40,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 2886 [2022-12-13 09:21:42,200 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:21:42,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2949 [2022-12-13 09:21:42,203 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 136 transitions, 1334 flow [2022-12-13 09:21:42,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:42,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:42,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:21:42,203 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1350951665, now seen corresponding path program 1 times [2022-12-13 09:21:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:42,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685664340] [2022-12-13 09:21:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:42,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685664340] [2022-12-13 09:21:42,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685664340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:42,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:42,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040802559] [2022-12-13 09:21:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:21:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:21:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:21:42,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2022-12-13 09:21:42,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 136 transitions, 1334 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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 09:21:42,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:42,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2022-12-13 09:21:42,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:45,112 INFO L130 PetriNetUnfolder]: 18932/27880 cut-off events. [2022-12-13 09:21:45,112 INFO L131 PetriNetUnfolder]: For 160487/161936 co-relation queries the response was YES. [2022-12-13 09:21:45,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128303 conditions, 27880 events. 18932/27880 cut-off events. For 160487/161936 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 183421 event pairs, 3314 based on Foata normal form. 1080/20674 useless extension candidates. Maximal degree in co-relation 128272. Up to 20917 conditions per place. [2022-12-13 09:21:45,386 INFO L137 encePairwiseOnDemand]: 38/53 looper letters, 176 selfloop transitions, 25 changer transitions 0/219 dead transitions. [2022-12-13 09:21:45,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 219 transitions, 2496 flow [2022-12-13 09:21:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:21:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:21:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-12-13 09:21:45,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6886792452830188 [2022-12-13 09:21:45,388 INFO L175 Difference]: Start difference. First operand has 85 places, 136 transitions, 1334 flow. Second operand 4 states and 146 transitions. [2022-12-13 09:21:45,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 219 transitions, 2496 flow [2022-12-13 09:21:45,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 219 transitions, 2483 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:21:45,446 INFO L231 Difference]: Finished difference. Result has 88 places, 147 transitions, 1442 flow [2022-12-13 09:21:45,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1442, PETRI_PLACES=88, PETRI_TRANSITIONS=147} [2022-12-13 09:21:45,446 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -3 predicate places. [2022-12-13 09:21:45,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:45,447 INFO L89 Accepts]: Start accepts. Operand has 88 places, 147 transitions, 1442 flow [2022-12-13 09:21:45,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:45,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:45,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 147 transitions, 1442 flow [2022-12-13 09:21:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 147 transitions, 1442 flow [2022-12-13 09:21:46,543 INFO L130 PetriNetUnfolder]: 6773/11923 cut-off events. [2022-12-13 09:21:46,543 INFO L131 PetriNetUnfolder]: For 40953/46189 co-relation queries the response was YES. [2022-12-13 09:21:46,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51064 conditions, 11923 events. 6773/11923 cut-off events. For 40953/46189 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 104047 event pairs, 2603 based on Foata normal form. 255/7743 useless extension candidates. Maximal degree in co-relation 51034. Up to 6649 conditions per place. [2022-12-13 09:21:46,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 147 transitions, 1442 flow [2022-12-13 09:21:46,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 3196 [2022-12-13 09:21:46,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L860-3-->L865: Formula: (and (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= (ite (= 0 (ite (= v_~__unbuffered_cnt~0_213 4) 1 0)) 0 1) v_~main$tmp_guard0~0_86)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_213} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_39|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_213, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [575] L753-->L871: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_312 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_544 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_315 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_501 256) 0)) .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_545 256) 0)) .cse5))) (and (= v_~x$r_buff0_thd0~0_314 (ite .cse0 0 v_~x$r_buff0_thd0~0_315)) (= v_~x$w_buff1_used~0_500 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_501)) (= (ite .cse2 v_~x$w_buff0~0_354 (ite .cse1 v_~x$w_buff1~0_331 1)) v_~x~0_458) (= (ite .cse2 0 v_~x$w_buff0_used~0_545) v_~x$w_buff0_used~0_544) (= v_~x$r_buff1_thd0~0_311 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_500 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_314 256) 0)))) 0 v_~x$r_buff1_thd0~0_312))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_315, ~x$w_buff1~0=v_~x$w_buff1~0_331, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_501, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_312, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_545} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_354, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_314, ~x$w_buff1~0=v_~x$w_buff1~0_331, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_500, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_311, ~x~0=v_~x~0_458, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_544} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:21:46,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:46,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1469 [2022-12-13 09:21:46,916 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 147 transitions, 1446 flow [2022-12-13 09:21:46,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 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 09:21:46,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:46,916 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 09:21:46,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 09:21:46,917 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1229243608, now seen corresponding path program 1 times [2022-12-13 09:21:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:46,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697752357] [2022-12-13 09:21:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:47,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697752357] [2022-12-13 09:21:47,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697752357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:47,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:47,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:21:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146633809] [2022-12-13 09:21:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:47,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:47,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:47,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:47,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2022-12-13 09:21:47,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 147 transitions, 1446 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 09:21:47,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:47,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2022-12-13 09:21:47,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:48,652 INFO L130 PetriNetUnfolder]: 10688/16558 cut-off events. [2022-12-13 09:21:48,652 INFO L131 PetriNetUnfolder]: For 89728/90781 co-relation queries the response was YES. [2022-12-13 09:21:48,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84853 conditions, 16558 events. 10688/16558 cut-off events. For 89728/90781 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 109398 event pairs, 965 based on Foata normal form. 1272/12613 useless extension candidates. Maximal degree in co-relation 84820. Up to 7690 conditions per place. [2022-12-13 09:21:48,792 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 185 selfloop transitions, 37 changer transitions 0/240 dead transitions. [2022-12-13 09:21:48,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2765 flow [2022-12-13 09:21:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:21:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:21:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2022-12-13 09:21:48,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6846153846153846 [2022-12-13 09:21:48,793 INFO L175 Difference]: Start difference. First operand has 88 places, 147 transitions, 1446 flow. Second operand 5 states and 178 transitions. [2022-12-13 09:21:48,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2765 flow [2022-12-13 09:21:48,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 240 transitions, 2715 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 09:21:48,846 INFO L231 Difference]: Finished difference. Result has 91 places, 158 transitions, 1573 flow [2022-12-13 09:21:48,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1573, PETRI_PLACES=91, PETRI_TRANSITIONS=158} [2022-12-13 09:21:48,846 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2022-12-13 09:21:48,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:48,846 INFO L89 Accepts]: Start accepts. Operand has 91 places, 158 transitions, 1573 flow [2022-12-13 09:21:48,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:48,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:48,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 158 transitions, 1573 flow [2022-12-13 09:21:48,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 158 transitions, 1573 flow [2022-12-13 09:21:49,365 INFO L130 PetriNetUnfolder]: 3065/6073 cut-off events. [2022-12-13 09:21:49,366 INFO L131 PetriNetUnfolder]: For 19008/21643 co-relation queries the response was YES. [2022-12-13 09:21:49,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28112 conditions, 6073 events. 3065/6073 cut-off events. For 19008/21643 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 52783 event pairs, 650 based on Foata normal form. 200/3632 useless extension candidates. Maximal degree in co-relation 28081. Up to 3709 conditions per place. [2022-12-13 09:21:49,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 158 transitions, 1573 flow [2022-12-13 09:21:49,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 3188 [2022-12-13 09:21:49,437 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:21:49,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 597 [2022-12-13 09:21:49,443 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 158 transitions, 1573 flow [2022-12-13 09:21:49,444 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 09:21:49,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:49,444 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] [2022-12-13 09:21:49,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 09:21:49,444 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:49,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1446238056, now seen corresponding path program 1 times [2022-12-13 09:21:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:49,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081984275] [2022-12-13 09:21:49,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:49,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081984275] [2022-12-13 09:21:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081984275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:49,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:49,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:21:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414884793] [2022-12-13 09:21:49,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:49,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:21:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:21:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:21:49,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-13 09:21:49,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 158 transitions, 1573 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:49,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:49,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-13 09:21:49,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:52,381 INFO L130 PetriNetUnfolder]: 16978/26174 cut-off events. [2022-12-13 09:21:52,381 INFO L131 PetriNetUnfolder]: For 132172/136663 co-relation queries the response was YES. [2022-12-13 09:21:52,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132830 conditions, 26174 events. 16978/26174 cut-off events. For 132172/136663 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 183644 event pairs, 3097 based on Foata normal form. 2339/23993 useless extension candidates. Maximal degree in co-relation 132796. Up to 13587 conditions per place. [2022-12-13 09:21:52,622 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 282 selfloop transitions, 17 changer transitions 14/336 dead transitions. [2022-12-13 09:21:52,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 336 transitions, 3908 flow [2022-12-13 09:21:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:21:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:21:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2022-12-13 09:21:52,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5947712418300654 [2022-12-13 09:21:52,624 INFO L175 Difference]: Start difference. First operand has 91 places, 158 transitions, 1573 flow. Second operand 6 states and 182 transitions. [2022-12-13 09:21:52,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 336 transitions, 3908 flow [2022-12-13 09:21:53,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 336 transitions, 3698 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 09:21:53,318 INFO L231 Difference]: Finished difference. Result has 95 places, 164 transitions, 1575 flow [2022-12-13 09:21:53,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1575, PETRI_PLACES=95, PETRI_TRANSITIONS=164} [2022-12-13 09:21:53,319 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2022-12-13 09:21:53,319 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:53,319 INFO L89 Accepts]: Start accepts. Operand has 95 places, 164 transitions, 1575 flow [2022-12-13 09:21:53,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:53,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:53,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 164 transitions, 1575 flow [2022-12-13 09:21:53,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 164 transitions, 1575 flow [2022-12-13 09:21:54,061 INFO L130 PetriNetUnfolder]: 4966/10044 cut-off events. [2022-12-13 09:21:54,061 INFO L131 PetriNetUnfolder]: For 28572/31031 co-relation queries the response was YES. [2022-12-13 09:21:54,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38593 conditions, 10044 events. 4966/10044 cut-off events. For 28572/31031 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 96351 event pairs, 648 based on Foata normal form. 230/5661 useless extension candidates. Maximal degree in co-relation 38560. Up to 4510 conditions per place. [2022-12-13 09:21:54,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 164 transitions, 1575 flow [2022-12-13 09:21:54,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 3286 [2022-12-13 09:21:54,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] $Ultimate##0-->L753: Formula: (and (= v_~a~0_23 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [394] L803-->L806: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 09:21:54,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] $Ultimate##0-->L753: Formula: (and (= v_~a~0_23 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [472] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff1_thd4~0_37 v_~x$r_buff0_thd4~0_33) (= 2 v_~x$w_buff0~0_126) (= v_~x$w_buff0_used~0_238 v_~x$w_buff1_used~0_203) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd2~0_43 v_~x$r_buff0_thd2~0_65) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_237 256) 0)) (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (= v_~x$r_buff1_thd1~0_43 v_~x$r_buff0_thd1~0_47) (= v_~x$r_buff0_thd0~0_107 v_~x$r_buff1_thd0~0_105) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_61) (= v_~x$w_buff0_used~0_237 1) (= v_~x$w_buff0~0_127 v_~x$w_buff1~0_114)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_127, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_238, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_126, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_47, ~x$w_buff1~0=v_~x$w_buff1~0_114, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_43, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_43, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_33, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_61, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_105, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_237, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-13 09:21:54,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] $Ultimate##0-->L753: Formula: (and (= v_~a~0_23 1) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [571] $Ultimate##0-->L826: Formula: (and (= v_~z~0_44 1) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_13|) (= v_~z~0_44 v_~__unbuffered_p3_EAX~0_117) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_13|)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_13|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_13|} OutVars{P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~z~0=v_~z~0_44, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_13|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] [2022-12-13 09:21:54,599 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:54,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1281 [2022-12-13 09:21:54,600 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 163 transitions, 1577 flow [2022-12-13 09:21:54,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:54,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:54,600 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] [2022-12-13 09:21:54,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 09:21:54,600 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:54,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -628916770, now seen corresponding path program 1 times [2022-12-13 09:21:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:54,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434871205] [2022-12-13 09:21:54,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:54,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:54,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434871205] [2022-12-13 09:21:54,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434871205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:54,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:54,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:21:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835663122] [2022-12-13 09:21:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:21:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:21:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:21:54,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 58 [2022-12-13 09:21:54,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 163 transitions, 1577 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:54,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:54,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 58 [2022-12-13 09:21:54,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:21:56,694 INFO L130 PetriNetUnfolder]: 13138/19741 cut-off events. [2022-12-13 09:21:56,694 INFO L131 PetriNetUnfolder]: For 108276/109421 co-relation queries the response was YES. [2022-12-13 09:21:56,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94998 conditions, 19741 events. 13138/19741 cut-off events. For 108276/109421 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 129337 event pairs, 505 based on Foata normal form. 1046/13620 useless extension candidates. Maximal degree in co-relation 94962. Up to 7119 conditions per place. [2022-12-13 09:21:56,975 INFO L137 encePairwiseOnDemand]: 44/58 looper letters, 154 selfloop transitions, 49 changer transitions 25/245 dead transitions. [2022-12-13 09:21:56,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 245 transitions, 2862 flow [2022-12-13 09:21:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:21:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:21:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2022-12-13 09:21:56,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5603448275862069 [2022-12-13 09:21:56,977 INFO L175 Difference]: Start difference. First operand has 94 places, 163 transitions, 1577 flow. Second operand 6 states and 195 transitions. [2022-12-13 09:21:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 245 transitions, 2862 flow [2022-12-13 09:21:57,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 245 transitions, 2783 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-13 09:21:57,757 INFO L231 Difference]: Finished difference. Result has 97 places, 148 transitions, 1425 flow [2022-12-13 09:21:57,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1425, PETRI_PLACES=97, PETRI_TRANSITIONS=148} [2022-12-13 09:21:57,770 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2022-12-13 09:21:57,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:57,770 INFO L89 Accepts]: Start accepts. Operand has 97 places, 148 transitions, 1425 flow [2022-12-13 09:21:57,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:57,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:57,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 148 transitions, 1425 flow [2022-12-13 09:21:57,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 148 transitions, 1425 flow [2022-12-13 09:21:57,985 INFO L130 PetriNetUnfolder]: 1874/3675 cut-off events. [2022-12-13 09:21:57,985 INFO L131 PetriNetUnfolder]: For 5366/6247 co-relation queries the response was YES. [2022-12-13 09:21:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14746 conditions, 3675 events. 1874/3675 cut-off events. For 5366/6247 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 29115 event pairs, 49 based on Foata normal form. 51/1668 useless extension candidates. Maximal degree in co-relation 14713. Up to 1576 conditions per place. [2022-12-13 09:21:58,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 148 transitions, 1425 flow [2022-12-13 09:21:58,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 2714 [2022-12-13 09:21:59,597 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:21:59,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1828 [2022-12-13 09:21:59,598 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 145 transitions, 1458 flow [2022-12-13 09:21:59,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:59,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:59,598 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] [2022-12-13 09:21:59,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 09:21:59,598 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:21:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1008222952, now seen corresponding path program 1 times [2022-12-13 09:21:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:59,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052079796] [2022-12-13 09:21:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:21:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:21:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:21:59,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052079796] [2022-12-13 09:21:59,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052079796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:21:59,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:21:59,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:21:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473738790] [2022-12-13 09:21:59,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:21:59,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:21:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:21:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:21:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:21:59,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2022-12-13 09:21:59,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 145 transitions, 1458 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:59,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:21:59,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2022-12-13 09:21:59,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:22:01,082 INFO L130 PetriNetUnfolder]: 10186/15395 cut-off events. [2022-12-13 09:22:01,082 INFO L131 PetriNetUnfolder]: For 77987/79422 co-relation queries the response was YES. [2022-12-13 09:22:01,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76770 conditions, 15395 events. 10186/15395 cut-off events. For 77987/79422 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 102213 event pairs, 943 based on Foata normal form. 656/12809 useless extension candidates. Maximal degree in co-relation 76734. Up to 6141 conditions per place. [2022-12-13 09:22:01,180 INFO L137 encePairwiseOnDemand]: 50/53 looper letters, 144 selfloop transitions, 1 changer transitions 114/284 dead transitions. [2022-12-13 09:22:01,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 284 transitions, 3442 flow [2022-12-13 09:22:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:22:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:22:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-12-13 09:22:01,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6273584905660378 [2022-12-13 09:22:01,182 INFO L175 Difference]: Start difference. First operand has 92 places, 145 transitions, 1458 flow. Second operand 4 states and 133 transitions. [2022-12-13 09:22:01,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 284 transitions, 3442 flow [2022-12-13 09:22:02,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 284 transitions, 3164 flow, removed 63 selfloop flow, removed 5 redundant places. [2022-12-13 09:22:02,369 INFO L231 Difference]: Finished difference. Result has 92 places, 123 transitions, 1058 flow [2022-12-13 09:22:02,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1058, PETRI_PLACES=92, PETRI_TRANSITIONS=123} [2022-12-13 09:22:02,370 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2022-12-13 09:22:02,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:22:02,370 INFO L89 Accepts]: Start accepts. Operand has 92 places, 123 transitions, 1058 flow [2022-12-13 09:22:02,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:22:02,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:22:02,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 123 transitions, 1058 flow [2022-12-13 09:22:02,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 123 transitions, 1058 flow [2022-12-13 09:22:02,557 INFO L130 PetriNetUnfolder]: 1775/3355 cut-off events. [2022-12-13 09:22:02,557 INFO L131 PetriNetUnfolder]: For 4432/4576 co-relation queries the response was YES. [2022-12-13 09:22:02,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11057 conditions, 3355 events. 1775/3355 cut-off events. For 4432/4576 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 25781 event pairs, 39 based on Foata normal form. 59/1339 useless extension candidates. Maximal degree in co-relation 11024. Up to 1234 conditions per place. [2022-12-13 09:22:02,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 123 transitions, 1058 flow [2022-12-13 09:22:02,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 2070 [2022-12-13 09:22:02,788 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:22:02,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 419 [2022-12-13 09:22:02,789 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 122 transitions, 1063 flow [2022-12-13 09:22:02,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:22:02,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:22:02,789 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] [2022-12-13 09:22:02,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 09:22:02,789 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:22:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:22:02,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1433535183, now seen corresponding path program 1 times [2022-12-13 09:22:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:22:02,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913493230] [2022-12-13 09:22:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:22:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:22:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:22:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:22:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:22:02,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913493230] [2022-12-13 09:22:02,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913493230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:22:02,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:22:02,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:22:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839095092] [2022-12-13 09:22:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:22:02,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:22:02,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:22:02,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:22:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:22:02,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 47 [2022-12-13 09:22:02,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 122 transitions, 1063 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:22:02,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:22:02,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 47 [2022-12-13 09:22:02,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:22:03,842 INFO L130 PetriNetUnfolder]: 6186/9550 cut-off events. [2022-12-13 09:22:03,843 INFO L131 PetriNetUnfolder]: For 49476/50152 co-relation queries the response was YES. [2022-12-13 09:22:03,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44245 conditions, 9550 events. 6186/9550 cut-off events. For 49476/50152 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 60938 event pairs, 1151 based on Foata normal form. 416/7628 useless extension candidates. Maximal degree in co-relation 44209. Up to 3594 conditions per place. [2022-12-13 09:22:03,900 INFO L137 encePairwiseOnDemand]: 43/47 looper letters, 72 selfloop transitions, 1 changer transitions 134/230 dead transitions. [2022-12-13 09:22:03,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 230 transitions, 2504 flow [2022-12-13 09:22:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:22:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:22:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-12-13 09:22:03,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6382978723404256 [2022-12-13 09:22:03,902 INFO L175 Difference]: Start difference. First operand has 89 places, 122 transitions, 1063 flow. Second operand 4 states and 120 transitions. [2022-12-13 09:22:03,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 230 transitions, 2504 flow [2022-12-13 09:22:04,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 230 transitions, 2469 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 09:22:04,458 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 585 flow [2022-12-13 09:22:04,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=585, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2022-12-13 09:22:04,458 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2022-12-13 09:22:04,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:22:04,458 INFO L89 Accepts]: Start accepts. Operand has 90 places, 83 transitions, 585 flow [2022-12-13 09:22:04,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:22:04,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:22:04,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 83 transitions, 585 flow [2022-12-13 09:22:04,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 83 transitions, 585 flow [2022-12-13 09:22:04,579 INFO L130 PetriNetUnfolder]: 1283/2342 cut-off events. [2022-12-13 09:22:04,579 INFO L131 PetriNetUnfolder]: For 2212/2288 co-relation queries the response was YES. [2022-12-13 09:22:04,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 2342 events. 1283/2342 cut-off events. For 2212/2288 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 15685 event pairs, 15 based on Foata normal form. 6/815 useless extension candidates. Maximal degree in co-relation 7295. Up to 973 conditions per place. [2022-12-13 09:22:04,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 83 transitions, 585 flow [2022-12-13 09:22:04,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-13 09:22:04,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] $Ultimate##0-->L756: Formula: (and (= v_~a~0_76 1) (= v_~x~0_539 1) (= v_P0Thread1of1ForFork0_~arg.base_46 |v_P0Thread1of1ForFork0_#in~arg.base_46|) (= v_P0Thread1of1ForFork0_~arg.offset_46 |v_P0Thread1of1ForFork0_#in~arg.offset_46|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_46|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_46|} OutVars{~a~0=v_~a~0_76, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_46|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_46|, ~x~0=v_~x~0_539, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_46, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_46} AuxVars[] AssignedVars[~a~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [395] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse4))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_52)) v_~x~0_51) (= (ite .cse0 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_100 256) 0)))) 0 v_~x$r_buff1_thd3~0_22) v_~x$r_buff1_thd3~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:22:05,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] $Ultimate##0-->L756: Formula: (and (= v_~a~0_76 1) (= v_~x~0_539 1) (= v_P0Thread1of1ForFork0_~arg.base_46 |v_P0Thread1of1ForFork0_#in~arg.base_46|) (= v_P0Thread1of1ForFork0_~arg.offset_46 |v_P0Thread1of1ForFork0_#in~arg.offset_46|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_46|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_46|} OutVars{~a~0=v_~a~0_76, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_46|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_46|, ~x~0=v_~x~0_539, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_46, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_46} AuxVars[] AssignedVars[~a~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [403] L829-->L836: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_147 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse2)) (.cse4 (and (not (= 0 (mod v_~x$w_buff0_used~0_148 256))) .cse5))) (and (= v_~x$w_buff1_used~0_126 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_127)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$r_buff0_thd4~0_21 (ite .cse1 0 v_~x$r_buff0_thd4~0_22)) (= v_~x~0_81 (ite .cse4 v_~x$w_buff0~0_58 (ite .cse0 v_~x$w_buff1~0_55 v_~x~0_82))) (= (ite .cse4 0 v_~x$w_buff0_used~0_148) v_~x$w_buff0_used~0_147)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_82, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_148} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_55, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_81, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_147} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-13 09:22:05,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] $Ultimate##0-->L756: Formula: (and (= v_~a~0_76 1) (= v_~x~0_539 1) (= v_P0Thread1of1ForFork0_~arg.base_46 |v_P0Thread1of1ForFork0_#in~arg.base_46|) (= v_P0Thread1of1ForFork0_~arg.offset_46 |v_P0Thread1of1ForFork0_#in~arg.offset_46|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_46|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_46|} OutVars{~a~0=v_~a~0_76, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_46|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_46|, ~x~0=v_~x~0_539, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_46, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_46} AuxVars[] AssignedVars[~a~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [388] L786-->L793: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_105 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_105) v_~x$w_buff1_used~0_104) (= v_~x$w_buff0_used~0_123 (ite .cse2 0 v_~x$w_buff0_used~0_124)) (= v_~x~0_55 (ite .cse2 v_~x$w_buff0~0_42 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_56))) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_104 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_24) v_~x$r_buff1_thd2~0_23) (= v_~x$r_buff0_thd2~0_28 (ite .cse0 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_42, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_42, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 09:22:05,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [402] L826-->L829: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [615] $Ultimate##0-->L836: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_692 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_121 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_121 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_630 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_693 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_444 (ite .cse1 v_~x$w_buff1~0_406 1)) v_~x~0_585) (= v_~x$w_buff1_used~0_629 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_630)) (= v_P0Thread1of1ForFork0_~arg.offset_64 |v_P0Thread1of1ForFork0_#in~arg.offset_64|) (= v_~x$r_buff1_thd4~0_120 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_629 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_120 256) 0)))) 0 v_~x$r_buff1_thd4~0_121)) (= v_~x$w_buff0_used~0_692 (ite .cse0 0 v_~x$w_buff0_used~0_693)) (= v_~x$r_buff0_thd4~0_120 (ite .cse2 0 v_~x$r_buff0_thd4~0_121)) (= v_P0Thread1of1ForFork0_~arg.base_64 |v_P0Thread1of1ForFork0_#in~arg.base_64|) (= v_~a~0_96 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_444, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_64|, ~x$w_buff1~0=v_~x$w_buff1~0_406, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_64|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_630, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_121, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_121, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_693} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_444, ~a~0=v_~a~0_96, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_64|, ~x$w_buff1~0=v_~x$w_buff1~0_406, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_64|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_629, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_120, ~x~0=v_~x~0_585, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_120, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_64, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_692} AuxVars[] AssignedVars[~a~0, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, P0Thread1of1ForFork0_~arg.base, ~x$r_buff1_thd4~0, P0Thread1of1ForFork0_~arg.offset, ~x$w_buff0_used~0] [2022-12-13 09:22:05,455 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 09:22:05,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 998 [2022-12-13 09:22:05,456 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 635 flow [2022-12-13 09:22:05,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:22:05,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:22:05,457 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 09:22:05,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 09:22:05,457 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:22:05,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:22:05,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1425875622, now seen corresponding path program 1 times [2022-12-13 09:22:05,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:22:05,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466301295] [2022-12-13 09:22:05,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:22:05,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:22:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:22:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:22:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:22:06,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466301295] [2022-12-13 09:22:06,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466301295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:22:06,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:22:06,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:22:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245796412] [2022-12-13 09:22:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:22:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:22:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:22:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:22:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:22:06,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2022-12-13 09:22:06,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 635 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:22:06,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:22:06,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2022-12-13 09:22:06,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:22:06,735 INFO L130 PetriNetUnfolder]: 4892/7561 cut-off events. [2022-12-13 09:22:06,735 INFO L131 PetriNetUnfolder]: For 31333/31721 co-relation queries the response was YES. [2022-12-13 09:22:06,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32929 conditions, 7561 events. 4892/7561 cut-off events. For 31333/31721 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 47593 event pairs, 250 based on Foata normal form. 291/5866 useless extension candidates. Maximal degree in co-relation 32894. Up to 3735 conditions per place. [2022-12-13 09:22:06,779 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 81 selfloop transitions, 15 changer transitions 8/126 dead transitions. [2022-12-13 09:22:06,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 126 transitions, 1102 flow [2022-12-13 09:22:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:22:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:22:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 09:22:06,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5024390243902439 [2022-12-13 09:22:06,781 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 635 flow. Second operand 5 states and 103 transitions. [2022-12-13 09:22:06,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 126 transitions, 1102 flow [2022-12-13 09:22:07,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 126 transitions, 970 flow, removed 38 selfloop flow, removed 14 redundant places. [2022-12-13 09:22:07,240 INFO L231 Difference]: Finished difference. Result has 73 places, 84 transitions, 591 flow [2022-12-13 09:22:07,240 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=73, PETRI_TRANSITIONS=84} [2022-12-13 09:22:07,240 INFO L295 CegarLoopForPetriNet]: 91 programPoint places, -18 predicate places. [2022-12-13 09:22:07,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:22:07,240 INFO L89 Accepts]: Start accepts. Operand has 73 places, 84 transitions, 591 flow [2022-12-13 09:22:07,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:22:07,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:22:07,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 84 transitions, 591 flow [2022-12-13 09:22:07,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 84 transitions, 591 flow [2022-12-13 09:22:07,452 INFO L130 PetriNetUnfolder]: 2241/3925 cut-off events. [2022-12-13 09:22:07,452 INFO L131 PetriNetUnfolder]: For 2941/3220 co-relation queries the response was YES. [2022-12-13 09:22:07,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11815 conditions, 3925 events. 2241/3925 cut-off events. For 2941/3220 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 30388 event pairs, 19 based on Foata normal form. 30/1362 useless extension candidates. Maximal degree in co-relation 11791. Up to 1702 conditions per place. [2022-12-13 09:22:07,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 84 transitions, 591 flow [2022-12-13 09:22:07,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 1310 [2022-12-13 09:22:07,709 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:22:07,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 470 [2022-12-13 09:22:07,710 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 559 flow [2022-12-13 09:22:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:22:07,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:22:07,710 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:22:07,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 09:22:07,710 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 09:22:07,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:22:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1033746934, now seen corresponding path program 1 times [2022-12-13 09:22:07,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:22:07,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487358358] [2022-12-13 09:22:07,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:22:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:22:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:22:07,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:22:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:22:07,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:22:07,811 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:22:07,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 09:22:07,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 09:22:07,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 09:22:07,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 09:22:07,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 09:22:07,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 09:22:07,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 09:22:07,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 09:22:07,817 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:22:07,821 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:22:07,821 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:22:07,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:22:07 BasicIcfg [2022-12-13 09:22:07,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:22:07,898 INFO L158 Benchmark]: Toolchain (without parser) took 86861.60ms. Allocated memory was 211.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 186.4MB in the beginning and 6.7GB in the end (delta: -6.5GB). Peak memory consumption was 450.4MB. Max. memory is 8.0GB. [2022-12-13 09:22:07,898 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 189.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:22:07,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.08ms. Allocated memory is still 211.8MB. Free memory was 186.0MB in the beginning and 158.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 09:22:07,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.19ms. Allocated memory is still 211.8MB. Free memory was 158.1MB in the beginning and 155.2MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:22:07,899 INFO L158 Benchmark]: Boogie Preprocessor took 44.58ms. Allocated memory is still 211.8MB. Free memory was 155.2MB in the beginning and 153.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:22:07,899 INFO L158 Benchmark]: RCFGBuilder took 698.09ms. Allocated memory was 211.8MB in the beginning and 309.3MB in the end (delta: 97.5MB). Free memory was 153.1MB in the beginning and 273.5MB in the end (delta: -120.4MB). Peak memory consumption was 34.0MB. Max. memory is 8.0GB. [2022-12-13 09:22:07,899 INFO L158 Benchmark]: TraceAbstraction took 85628.25ms. Allocated memory was 309.3MB in the beginning and 7.2GB in the end (delta: 6.9GB). Free memory was 272.5MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 437.3MB. Max. memory is 8.0GB. [2022-12-13 09:22:07,901 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 189.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.08ms. Allocated memory is still 211.8MB. Free memory was 186.0MB in the beginning and 158.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.19ms. Allocated memory is still 211.8MB. Free memory was 158.1MB in the beginning and 155.2MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.58ms. Allocated memory is still 211.8MB. Free memory was 155.2MB in the beginning and 153.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 698.09ms. Allocated memory was 211.8MB in the beginning and 309.3MB in the end (delta: 97.5MB). Free memory was 153.1MB in the beginning and 273.5MB in the end (delta: -120.4MB). Peak memory consumption was 34.0MB. Max. memory is 8.0GB. * TraceAbstraction took 85628.25ms. Allocated memory was 309.3MB in the beginning and 7.2GB in the end (delta: 6.9GB). Free memory was 272.5MB in the beginning and 6.7GB in the end (delta: -6.4GB). Peak memory consumption was 437.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 138 PlacesBefore, 91 PlacesAfterwards, 127 TransitionsBefore, 79 TransitionsAfterwards, 3150 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4792, independent: 4628, independent conditional: 4628, independent unconditional: 0, dependent: 164, dependent conditional: 164, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2992, independent: 2932, independent conditional: 0, independent unconditional: 2932, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2992, independent: 2932, independent conditional: 0, independent unconditional: 2932, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2992, independent: 2891, independent conditional: 0, independent unconditional: 2891, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 387, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 338, dependent conditional: 0, dependent unconditional: 338, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4792, independent: 1696, independent conditional: 1696, independent unconditional: 0, dependent: 104, dependent conditional: 104, dependent unconditional: 0, unknown: 2992, unknown conditional: 2992, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2994, Positive cache size: 2934, Positive conditional cache size: 2934, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 455, independent: 409, independent conditional: 409, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 370, independent conditional: 15, independent unconditional: 355, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 405, independent: 370, independent conditional: 15, independent unconditional: 355, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 405, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 35, dependent conditional: 1, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 88, dependent conditional: 6, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 455, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 405, unknown conditional: 405, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 370, Positive conditional cache size: 370, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 1094 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 922, independent: 837, independent conditional: 837, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 106, independent conditional: 24, independent unconditional: 82, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 112, independent: 106, independent conditional: 24, independent unconditional: 82, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 112, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 922, independent: 731, independent conditional: 731, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 112, unknown conditional: 112, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 476, Positive conditional cache size: 476, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 57 PlacesBefore, 56 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 1256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 853, independent: 810, independent conditional: 810, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 23, independent unconditional: 32, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 23, independent unconditional: 32, 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: 59, independent: 55, independent conditional: 0, independent unconditional: 55, 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: 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: 853, independent: 755, independent conditional: 755, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 531, Positive conditional cache size: 531, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 772, independent: 741, independent conditional: 741, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 772, independent: 705, independent conditional: 705, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 615, Positive cache size: 567, Positive conditional cache size: 567, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 737, independent: 706, independent conditional: 706, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 737, independent: 686, independent conditional: 686, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 637, Positive cache size: 587, Positive conditional cache size: 587, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 69 PlacesBefore, 69 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1814 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1891, independent: 1821, independent conditional: 1821, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 29, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 29, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 1891, independent: 1790, independent conditional: 1790, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 618, Positive conditional cache size: 618, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 1932 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 886, independent: 850, independent conditional: 850, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, 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: 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: 886, independent: 839, independent conditional: 839, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 629, Positive conditional cache size: 629, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 2062 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1307, independent: 1258, independent conditional: 1258, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 15, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 1307, independent: 1240, independent conditional: 1240, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 647, Positive conditional cache size: 647, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 2214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1271, independent: 1222, independent conditional: 1222, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 8, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 1271, independent: 1213, independent conditional: 1213, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 706, Positive cache size: 656, Positive conditional cache size: 656, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 2338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1271, independent: 1222, independent conditional: 1222, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 10, 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: 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: 1271, independent: 1211, independent conditional: 1211, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 717, Positive cache size: 667, Positive conditional cache size: 667, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 2618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1604, independent: 1552, independent conditional: 1552, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 1604, independent: 1533, independent conditional: 1533, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 686, Positive conditional cache size: 686, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 2708 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1532, independent: 1480, independent conditional: 1480, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 1532, independent: 1465, independent conditional: 1465, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 701, Positive conditional cache size: 701, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 85 PlacesBefore, 85 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 2886 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1913, independent: 1855, independent conditional: 1855, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 87, independent conditional: 51, independent unconditional: 36, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 87, independent conditional: 51, independent unconditional: 36, 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: 87, independent: 87, independent conditional: 0, independent unconditional: 87, 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: 1913, independent: 1768, independent conditional: 1768, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 788, Positive conditional cache size: 788, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 88 PlacesBefore, 88 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 3196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2085, independent: 2028, independent conditional: 2028, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 24, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 24, independent unconditional: 20, 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: 44, independent: 44, independent conditional: 0, independent unconditional: 44, 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: 2085, independent: 1984, independent conditional: 1984, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 832, Positive conditional cache size: 832, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 158 TransitionsBefore, 158 TransitionsAfterwards, 3188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1006, independent: 978, independent conditional: 978, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 15, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 15, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 1006, independent: 962, independent conditional: 962, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 898, Positive cache size: 848, Positive conditional cache size: 848, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 95 PlacesBefore, 94 PlacesAfterwards, 164 TransitionsBefore, 163 TransitionsAfterwards, 3286 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 17, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 203, independent: 171, independent conditional: 171, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 916, Positive cache size: 866, Positive conditional cache size: 866, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 95 PlacesBefore, 92 PlacesAfterwards, 148 TransitionsBefore, 145 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 918, independent: 912, independent conditional: 912, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 54, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 54, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 0, independent unconditional: 70, 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: 918, independent: 842, independent conditional: 842, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 70, unknown conditional: 70, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 936, Positive conditional cache size: 936, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 90 PlacesBefore, 89 PlacesAfterwards, 123 TransitionsBefore, 122 TransitionsAfterwards, 2070 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 130, independent conditional: 108, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 130, independent: 130, independent conditional: 108, independent unconditional: 22, 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: 130, independent: 130, independent conditional: 0, independent unconditional: 130, 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: 210, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 130, unknown conditional: 130, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1116, Positive cache size: 1066, Positive conditional cache size: 1066, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 85 PlacesBefore, 82 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 71, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 71, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 85, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 132, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 85, unknown conditional: 85, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1201, Positive cache size: 1151, Positive conditional cache size: 1151, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 73 PlacesAfterwards, 84 TransitionsBefore, 82 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 69, independent conditional: 65, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, independent: 69, independent conditional: 65, independent unconditional: 4, 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: 69, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 69, unknown conditional: 69, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1270, Positive cache size: 1220, Positive conditional cache size: 1220, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-3, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-2, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 4 z = 1 [L825] 4 __unbuffered_p3_EAX = z [L828] 4 __unbuffered_p3_EBX = a [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 a = 1 [L755] 1 x = 1 [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: 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, 168 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: 85.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 899 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 36 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1714occurred in iteration=12, InterpolantAutomatonStates: 86, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 3517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:22:07,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...