/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:53:20,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:53:20,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:53:20,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:53:20,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:53:20,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:53:20,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:53:20,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:53:20,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:53:20,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:53:20,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:53:20,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:53:20,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:53:20,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:53:20,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:53:20,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:53:20,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:53:20,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:53:20,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:53:20,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:53:20,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:53:20,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:53:20,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:53:20,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:53:20,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:53:20,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:53:20,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:53:20,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:53:20,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:53:20,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:53:20,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:53:20,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:53:20,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:53:20,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:53:20,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:53:20,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:53:20,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:53:20,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:53:20,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:53:20,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:53:20,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:53:20,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:53:20,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:53:20,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:53:20,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:53:20,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:53:20,478 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:53:20,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:53:20,478 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:53:20,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:53:20,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:53:20,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:53:20,479 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:53:20,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:53:20,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:53:20,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:53:20,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:53:20,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:53:20,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:53:20,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:53:20,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:53:20,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:53:20,795 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:53:20,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2022-12-05 22:53:21,804 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:53:22,074 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:53:22,074 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2022-12-05 22:53:22,085 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd13dcdde/7941bb9b361340b78f4a82f1f6ff9b64/FLAGe9396cf1a [2022-12-05 22:53:22,097 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd13dcdde/7941bb9b361340b78f4a82f1f6ff9b64 [2022-12-05 22:53:22,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:53:22,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:53:22,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:53:22,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:53:22,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:53:22,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f26b0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22, skipping insertion in model container [2022-12-05 22:53:22,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:53:22,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:53:22,291 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/mix001.oepc.i[988,1001] [2022-12-05 22:53:22,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:53:22,492 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:53:22,501 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/mix001.oepc.i[988,1001] [2022-12-05 22:53:22,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:22,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:22,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:53:22,597 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:53:22,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22 WrapperNode [2022-12-05 22:53:22,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:53:22,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:53:22,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:53:22,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:53:22,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,662 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-05 22:53:22,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:53:22,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:53:22,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:53:22,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:53:22,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,696 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:53:22,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:53:22,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:53:22,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:53:22,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (1/1) ... [2022-12-05 22:53:22,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:53:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53:22,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 22:53:22,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 22:53:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:53:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:53:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:53:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:53:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:53:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:53:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:53:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:53:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:53:22,781 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:53:22,939 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:53:22,940 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:53:23,151 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:53:23,293 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:53:23,294 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:53:23,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:53:23 BoogieIcfgContainer [2022-12-05 22:53:23,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:53:23,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:53:23,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:53:23,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:53:23,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:53:22" (1/3) ... [2022-12-05 22:53:23,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f27157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:53:23, skipping insertion in model container [2022-12-05 22:53:23,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:22" (2/3) ... [2022-12-05 22:53:23,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f27157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:53:23, skipping insertion in model container [2022-12-05 22:53:23,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:53:23" (3/3) ... [2022-12-05 22:53:23,303 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2022-12-05 22:53:23,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:53:23,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:53:23,337 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:53:23,415 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:53:23,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-05 22:53:23,478 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-05 22:53:23,478 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:23,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-05 22:53:23,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-05 22:53:23,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-05 22:53:23,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:23,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-05 22:53:23,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-05 22:53:23,522 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-05 22:53:23,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:23,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-05 22:53:23,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-05 22:53:23,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 2230 [2022-12-05 22:53:27,354 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-05 22:53:27,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:53:27,367 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;@1de65413, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:53:27,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:53:27,369 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-05 22:53:27,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:27,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:27,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 22:53:27,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash 518148, now seen corresponding path program 1 times [2022-12-05 22:53:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:27,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209613552] [2022-12-05 22:53:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:27,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209613552] [2022-12-05 22:53:27,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209613552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:27,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:27,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:27,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143675588] [2022-12-05 22:53:27,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:27,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:27,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 22:53:27,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:27,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:27,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 22:53:27,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:27,876 INFO L130 PetriNetUnfolder]: 1416/2137 cut-off events. [2022-12-05 22:53:27,876 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-05 22:53:27,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4286 conditions, 2137 events. 1416/2137 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10398 event pairs, 626 based on Foata normal form. 0/1898 useless extension candidates. Maximal degree in co-relation 4275. Up to 1781 conditions per place. [2022-12-05 22:53:27,889 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 32 selfloop transitions, 2 changer transitions 8/46 dead transitions. [2022-12-05 22:53:27,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 191 flow [2022-12-05 22:53:27,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-05 22:53:27,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6344086021505376 [2022-12-05 22:53:27,899 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 59 transitions. [2022-12-05 22:53:27,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 191 flow [2022-12-05 22:53:27,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:53:27,904 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 58 flow [2022-12-05 22:53:27,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-05 22:53:27,908 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-05 22:53:27,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:27,909 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 58 flow [2022-12-05 22:53:27,911 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:27,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:27,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 58 flow [2022-12-05 22:53:27,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2022-12-05 22:53:27,918 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-05 22:53:27,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:27,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:53:27,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2022-12-05 22:53:27,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-05 22:53:27,996 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:27,998 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-05 22:53:27,999 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2022-12-05 22:53:27,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:27,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:27,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:27,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:53:28,002 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1345911435, now seen corresponding path program 1 times [2022-12-05 22:53:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:28,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82728979] [2022-12-05 22:53:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:28,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:28,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82728979] [2022-12-05 22:53:28,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82728979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:28,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:28,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:28,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856264917] [2022-12-05 22:53:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:28,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:28,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:28,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:28,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:53:28,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:28,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:28,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:53:28,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:28,469 INFO L130 PetriNetUnfolder]: 2051/2992 cut-off events. [2022-12-05 22:53:28,469 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-05 22:53:28,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 2992 events. 2051/2992 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12808 event pairs, 995 based on Foata normal form. 8/3000 useless extension candidates. Maximal degree in co-relation 6218. Up to 2917 conditions per place. [2022-12-05 22:53:28,481 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2022-12-05 22:53:28,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 160 flow [2022-12-05 22:53:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 22:53:28,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-05 22:53:28,483 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 37 transitions. [2022-12-05 22:53:28,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 160 flow [2022-12-05 22:53:28,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:28,484 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 80 flow [2022-12-05 22:53:28,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-05 22:53:28,485 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places. [2022-12-05 22:53:28,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:28,485 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 80 flow [2022-12-05 22:53:28,485 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:28,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:28,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 80 flow [2022-12-05 22:53:28,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 80 flow [2022-12-05 22:53:28,492 INFO L130 PetriNetUnfolder]: 14/72 cut-off events. [2022-12-05 22:53:28,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:28,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 72 events. 14/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 238 event pairs, 6 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 105. Up to 29 conditions per place. [2022-12-05 22:53:28,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 80 flow [2022-12-05 22:53:28,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-05 22:53:28,541 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:28,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-05 22:53:28,542 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 80 flow [2022-12-05 22:53:28,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:28,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:28,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:28,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:53:28,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:28,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1985800103, now seen corresponding path program 1 times [2022-12-05 22:53:28,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:28,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578973011] [2022-12-05 22:53:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578973011] [2022-12-05 22:53:28,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578973011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:28,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:28,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442733032] [2022-12-05 22:53:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:28,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:53:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:53:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:53:28,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:53:28,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 80 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:28,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:28,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:53:28,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:29,147 INFO L130 PetriNetUnfolder]: 2095/3058 cut-off events. [2022-12-05 22:53:29,148 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-05 22:53:29,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6906 conditions, 3058 events. 2095/3058 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13269 event pairs, 823 based on Foata normal form. 34/3092 useless extension candidates. Maximal degree in co-relation 6895. Up to 2712 conditions per place. [2022-12-05 22:53:29,160 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 55 selfloop transitions, 15 changer transitions 0/70 dead transitions. [2022-12-05 22:53:29,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 70 transitions, 336 flow [2022-12-05 22:53:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-05 22:53:29,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 22:53:29,161 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 80 flow. Second operand 5 states and 70 transitions. [2022-12-05 22:53:29,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 70 transitions, 336 flow [2022-12-05 22:53:29,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 70 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:29,163 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 186 flow [2022-12-05 22:53:29,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-05 22:53:29,164 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-05 22:53:29,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:29,164 INFO L89 Accepts]: Start accepts. Operand has 40 places, 39 transitions, 186 flow [2022-12-05 22:53:29,165 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:29,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:29,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 39 transitions, 186 flow [2022-12-05 22:53:29,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 39 transitions, 186 flow [2022-12-05 22:53:29,176 INFO L130 PetriNetUnfolder]: 55/157 cut-off events. [2022-12-05 22:53:29,176 INFO L131 PetriNetUnfolder]: For 172/207 co-relation queries the response was YES. [2022-12-05 22:53:29,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 157 events. 55/157 cut-off events. For 172/207 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 753 event pairs, 21 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 421. Up to 69 conditions per place. [2022-12-05 22:53:29,178 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 39 transitions, 186 flow [2022-12-05 22:53:29,178 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-05 22:53:29,236 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:29,237 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-05 22:53:29,237 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 186 flow [2022-12-05 22:53:29,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:29,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:29,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:29,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:53:29,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1164099068, now seen corresponding path program 1 times [2022-12-05 22:53:29,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:29,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801906805] [2022-12-05 22:53:29,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:29,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801906805] [2022-12-05 22:53:29,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801906805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:29,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:29,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:53:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714153959] [2022-12-05 22:53:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:29,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:29,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:29,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:53:29,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:29,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:29,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:53:29,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:29,666 INFO L130 PetriNetUnfolder]: 1971/2886 cut-off events. [2022-12-05 22:53:29,666 INFO L131 PetriNetUnfolder]: For 2563/2563 co-relation queries the response was YES. [2022-12-05 22:53:29,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8226 conditions, 2886 events. 1971/2886 cut-off events. For 2563/2563 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12328 event pairs, 980 based on Foata normal form. 48/2934 useless extension candidates. Maximal degree in co-relation 8211. Up to 2169 conditions per place. [2022-12-05 22:53:29,681 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 50 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2022-12-05 22:53:29,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 347 flow [2022-12-05 22:53:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:29,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 22:53:29,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-05 22:53:29,682 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 186 flow. Second operand 3 states and 41 transitions. [2022-12-05 22:53:29,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 347 flow [2022-12-05 22:53:29,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 339 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-05 22:53:29,686 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 197 flow [2022-12-05 22:53:29,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-12-05 22:53:29,686 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2022-12-05 22:53:29,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:29,686 INFO L89 Accepts]: Start accepts. Operand has 43 places, 39 transitions, 197 flow [2022-12-05 22:53:29,687 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:29,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:29,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 39 transitions, 197 flow [2022-12-05 22:53:29,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 197 flow [2022-12-05 22:53:29,720 INFO L130 PetriNetUnfolder]: 48/140 cut-off events. [2022-12-05 22:53:29,720 INFO L131 PetriNetUnfolder]: For 198/217 co-relation queries the response was YES. [2022-12-05 22:53:29,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 140 events. 48/140 cut-off events. For 198/217 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 634 event pairs, 15 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 388. Up to 59 conditions per place. [2022-12-05 22:53:29,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 39 transitions, 197 flow [2022-12-05 22:53:29,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-05 22:53:29,743 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:29,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-05 22:53:29,750 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 197 flow [2022-12-05 22:53:29,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:29,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:29,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:29,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:53:29,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1417135279, now seen corresponding path program 1 times [2022-12-05 22:53:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:29,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931919856] [2022-12-05 22:53:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:30,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-05 22:53:30,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:30,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931919856] [2022-12-05 22:53:30,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931919856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:30,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:30,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:53:30,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229119569] [2022-12-05 22:53:30,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:30,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:53:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:53:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:53:30,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:53:30,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 197 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:30,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:30,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:53:30,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:30,429 INFO L130 PetriNetUnfolder]: 1875/2754 cut-off events. [2022-12-05 22:53:30,429 INFO L131 PetriNetUnfolder]: For 2991/2991 co-relation queries the response was YES. [2022-12-05 22:53:30,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8086 conditions, 2754 events. 1875/2754 cut-off events. For 2991/2991 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11758 event pairs, 443 based on Foata normal form. 44/2798 useless extension candidates. Maximal degree in co-relation 8068. Up to 1922 conditions per place. [2022-12-05 22:53:30,442 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 62 selfloop transitions, 18 changer transitions 0/80 dead transitions. [2022-12-05 22:53:30,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 80 transitions, 521 flow [2022-12-05 22:53:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-05 22:53:30,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 22:53:30,443 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 197 flow. Second operand 5 states and 65 transitions. [2022-12-05 22:53:30,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 80 transitions, 521 flow [2022-12-05 22:53:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 505 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:30,448 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 332 flow [2022-12-05 22:53:30,448 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2022-12-05 22:53:30,448 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2022-12-05 22:53:30,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:30,448 INFO L89 Accepts]: Start accepts. Operand has 48 places, 50 transitions, 332 flow [2022-12-05 22:53:30,449 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:30,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:30,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 50 transitions, 332 flow [2022-12-05 22:53:30,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 332 flow [2022-12-05 22:53:30,465 INFO L130 PetriNetUnfolder]: 81/214 cut-off events. [2022-12-05 22:53:30,465 INFO L131 PetriNetUnfolder]: For 279/312 co-relation queries the response was YES. [2022-12-05 22:53:30,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 214 events. 81/214 cut-off events. For 279/312 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1085 event pairs, 13 based on Foata normal form. 9/212 useless extension candidates. Maximal degree in co-relation 676. Up to 79 conditions per place. [2022-12-05 22:53:30,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 50 transitions, 332 flow [2022-12-05 22:53:30,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-05 22:53:30,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:30,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 22:53:30,469 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 332 flow [2022-12-05 22:53:30,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:30,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:30,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:30,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:53:30,469 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1994558666, now seen corresponding path program 1 times [2022-12-05 22:53:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:30,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481326309] [2022-12-05 22:53:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:30,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481326309] [2022-12-05 22:53:30,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481326309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:30,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:30,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:53:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965507979] [2022-12-05 22:53:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:30,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:30,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:30,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:30,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:30,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:53:30,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 332 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:30,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:30,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:53:30,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:30,797 INFO L130 PetriNetUnfolder]: 1795/2642 cut-off events. [2022-12-05 22:53:30,798 INFO L131 PetriNetUnfolder]: For 3244/3244 co-relation queries the response was YES. [2022-12-05 22:53:30,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 2642 events. 1795/2642 cut-off events. For 3244/3244 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11002 event pairs, 487 based on Foata normal form. 32/2674 useless extension candidates. Maximal degree in co-relation 8330. Up to 1805 conditions per place. [2022-12-05 22:53:30,810 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 63 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-12-05 22:53:30,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 545 flow [2022-12-05 22:53:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 22:53:30,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2022-12-05 22:53:30,812 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 332 flow. Second operand 3 states and 37 transitions. [2022-12-05 22:53:30,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 545 flow [2022-12-05 22:53:30,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:30,816 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 335 flow [2022-12-05 22:53:30,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2022-12-05 22:53:30,816 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2022-12-05 22:53:30,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:30,817 INFO L89 Accepts]: Start accepts. Operand has 50 places, 50 transitions, 335 flow [2022-12-05 22:53:30,817 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:30,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:30,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 50 transitions, 335 flow [2022-12-05 22:53:30,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 335 flow [2022-12-05 22:53:30,833 INFO L130 PetriNetUnfolder]: 75/214 cut-off events. [2022-12-05 22:53:30,833 INFO L131 PetriNetUnfolder]: For 341/373 co-relation queries the response was YES. [2022-12-05 22:53:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 214 events. 75/214 cut-off events. For 341/373 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1113 event pairs, 12 based on Foata normal form. 10/210 useless extension candidates. Maximal degree in co-relation 659. Up to 70 conditions per place. [2022-12-05 22:53:30,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 50 transitions, 335 flow [2022-12-05 22:53:30,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-05 22:53:30,840 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:30,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-05 22:53:30,841 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 335 flow [2022-12-05 22:53:30,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:30,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:30,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:30,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:53:30,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -112247941, now seen corresponding path program 1 times [2022-12-05 22:53:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544493892] [2022-12-05 22:53:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:30,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:30,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544493892] [2022-12-05 22:53:30,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544493892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:30,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:30,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230554401] [2022-12-05 22:53:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:30,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:30,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:30,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:30,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:30,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-05 22:53:30,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:30,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:30,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-05 22:53:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:31,257 INFO L130 PetriNetUnfolder]: 905/1522 cut-off events. [2022-12-05 22:53:31,257 INFO L131 PetriNetUnfolder]: For 2073/2122 co-relation queries the response was YES. [2022-12-05 22:53:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 1522 events. 905/1522 cut-off events. For 2073/2122 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7872 event pairs, 144 based on Foata normal form. 181/1670 useless extension candidates. Maximal degree in co-relation 4500. Up to 714 conditions per place. [2022-12-05 22:53:31,265 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 68 selfloop transitions, 8 changer transitions 8/98 dead transitions. [2022-12-05 22:53:31,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 98 transitions, 721 flow [2022-12-05 22:53:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-05 22:53:31,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-05 22:53:31,267 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 335 flow. Second operand 5 states and 80 transitions. [2022-12-05 22:53:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 98 transitions, 721 flow [2022-12-05 22:53:31,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 98 transitions, 713 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:31,270 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 334 flow [2022-12-05 22:53:31,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-05 22:53:31,271 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2022-12-05 22:53:31,271 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:31,271 INFO L89 Accepts]: Start accepts. Operand has 55 places, 51 transitions, 334 flow [2022-12-05 22:53:31,272 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:31,272 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:31,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 334 flow [2022-12-05 22:53:31,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 334 flow [2022-12-05 22:53:31,297 INFO L130 PetriNetUnfolder]: 98/278 cut-off events. [2022-12-05 22:53:31,297 INFO L131 PetriNetUnfolder]: For 589/650 co-relation queries the response was YES. [2022-12-05 22:53:31,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 278 events. 98/278 cut-off events. For 589/650 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1642 event pairs, 27 based on Foata normal form. 16/271 useless extension candidates. Maximal degree in co-relation 935. Up to 108 conditions per place. [2022-12-05 22:53:31,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 334 flow [2022-12-05 22:53:31,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-05 22:53:31,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L762: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_113 v_~z$r_buff1_thd1~0_95) (= v_~z$r_buff0_thd0~0_45 v_~z$r_buff1_thd0~0_39) (= v_~z$w_buff0~0_147 v_~z$w_buff1~0_139) (= v_~z$r_buff0_thd3~0_101 v_~z$r_buff1_thd3~0_95) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_234 256) 0)) (not (= (mod v_~z$w_buff0_used~0_245 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_245 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_39) (= v_~z$w_buff0~0_146 1) (= v_~z$w_buff0_used~0_246 v_~z$w_buff1_used~0_234) (= v_~z$r_buff0_thd1~0_112 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_246, ~z$w_buff0~0=v_~z$w_buff0~0_147, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_113, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_245, ~z$w_buff0~0=v_~z$w_buff0~0_146, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_95, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_234, ~z$w_buff1~0=v_~z$w_buff1~0_139, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_95, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_112, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [386] L824-->L840: Formula: (let ((.cse3 (= (mod v_~z$r_buff1_thd3~0_52 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_60 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 .cse3)) (.cse6 (and .cse7 (= (mod v_~z$w_buff1_used~0_147 256) 0))) (.cse12 (= (mod v_~z$w_buff0_used~0_156 256) 0))) (let ((.cse10 (or .cse5 .cse6 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~z$w_buff1_used~0_146 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_155 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_54 256) 0))) (.cse9 (ite .cse10 v_~z~0_94 (ite .cse11 v_~z$w_buff0~0_79 v_~z$w_buff1~0_80)))) (and (= v_~z$flush_delayed~0_28 0) (= v_~z$w_buff1~0_80 v_~z$w_buff1~0_79) (= |v_P2Thread1of1ForFork0_#t~nondet5_1| v_~weak$$choice0~0_10) (= (ite .cse0 v_~z$r_buff1_thd3~0_52 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~z$r_buff1_thd3~0_52 0)) v_~z$r_buff1_thd3~0_51) (= v_~z$mem_tmp~0_26 v_~z~0_94) (= v_~z$w_buff1_used~0_146 (ite .cse0 v_~z$w_buff1_used~0_147 (ite (or .cse5 .cse6 .cse4) v_~z$w_buff1_used~0_147 0))) (= v_~z$r_buff0_thd3~0_59 (ite .cse0 v_~z$r_buff0_thd3~0_60 (ite (or .cse5 .cse4 (and .cse7 .cse1)) v_~z$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse8) 0 v_~z$r_buff0_thd3~0_60)))) (= |v_P2Thread1of1ForFork0_#t~nondet6_1| v_~weak$$choice2~0_54) (= v_~__unbuffered_p2_EBX~0_14 .cse9) (= v_~z$w_buff0_used~0_155 (ite .cse0 v_~z$w_buff0_used~0_156 (ite .cse10 v_~z$w_buff0_used~0_156 (ite .cse11 0 v_~z$w_buff0_used~0_156)))) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_26 .cse9)) (= v_~z$w_buff0~0_79 v_~z$w_buff0~0_78)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_80, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_1|, ~z~0=v_~z~0_94, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_78, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_79, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_54} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet6, ~z$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0] [2022-12-05 22:53:32,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L762: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_113 v_~z$r_buff1_thd1~0_95) (= v_~z$r_buff0_thd0~0_45 v_~z$r_buff1_thd0~0_39) (= v_~z$w_buff0~0_147 v_~z$w_buff1~0_139) (= v_~z$r_buff0_thd3~0_101 v_~z$r_buff1_thd3~0_95) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_234 256) 0)) (not (= (mod v_~z$w_buff0_used~0_245 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_245 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_39) (= v_~z$w_buff0~0_146 1) (= v_~z$w_buff0_used~0_246 v_~z$w_buff1_used~0_234) (= v_~z$r_buff0_thd1~0_112 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_246, ~z$w_buff0~0=v_~z$w_buff0~0_147, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_113, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_245, ~z$w_buff0~0=v_~z$w_buff0~0_146, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_95, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_234, ~z$w_buff1~0=v_~z$w_buff1~0_139, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_95, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_112, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [377] L798-->L801: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-05 22:53:32,303 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L762: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_113 v_~z$r_buff1_thd1~0_95) (= v_~z$r_buff0_thd0~0_45 v_~z$r_buff1_thd0~0_39) (= v_~z$w_buff0~0_147 v_~z$w_buff1~0_139) (= v_~z$r_buff0_thd3~0_101 v_~z$r_buff1_thd3~0_95) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_234 256) 0)) (not (= (mod v_~z$w_buff0_used~0_245 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_245 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_39) (= v_~z$w_buff0~0_146 1) (= v_~z$w_buff0_used~0_246 v_~z$w_buff1_used~0_234) (= v_~z$r_buff0_thd1~0_112 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_246, ~z$w_buff0~0=v_~z$w_buff0~0_147, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_113, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_245, ~z$w_buff0~0=v_~z$w_buff0~0_146, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_95, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_234, ~z$w_buff1~0=v_~z$w_buff1~0_139, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_95, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_112, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [387] L840-->L847: Formula: (let ((.cse2 (not (= 0 (mod v_~z$r_buff1_thd3~0_58 256)))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_179 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_68 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_180 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~z$w_buff1_used~0_171 256) 0))))) (and (= v_~z$w_buff0_used~0_179 (ite .cse0 0 v_~z$w_buff0_used~0_180)) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_67 256) 0)) .cse1) (and (not (= (mod v_~z$w_buff1_used~0_170 256) 0)) .cse2)) 0 v_~z$r_buff1_thd3~0_58) v_~z$r_buff1_thd3~0_57) (= v_~z$r_buff0_thd3~0_67 (ite .cse3 0 v_~z$r_buff0_thd3~0_68)) (= v_~z$w_buff1_used~0_170 (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_171)) (= (ite .cse0 v_~z$w_buff0~0_94 (ite .cse4 v_~z$w_buff1~0_95 v_~z~0_117)) v_~z~0_116)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_180, ~z$w_buff0~0=v_~z$w_buff0~0_94, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_171, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~z$w_buff1~0=v_~z$w_buff1~0_95, ~z~0=v_~z~0_117} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_179, ~z$w_buff0~0=v_~z$w_buff0~0_94, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_57, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_170, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~z$w_buff1~0=v_~z$w_buff1~0_95, ~z~0=v_~z~0_116} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 22:53:32,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] $Ultimate##0-->L762: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_113 v_~z$r_buff1_thd1~0_95) (= v_~z$r_buff0_thd0~0_45 v_~z$r_buff1_thd0~0_39) (= v_~z$w_buff0~0_147 v_~z$w_buff1~0_139) (= v_~z$r_buff0_thd3~0_101 v_~z$r_buff1_thd3~0_95) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_234 256) 0)) (not (= (mod v_~z$w_buff0_used~0_245 256) 0)))) 1 0)) (= v_~z$w_buff0_used~0_245 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_39) (= v_~z$w_buff0~0_146 1) (= v_~z$w_buff0_used~0_246 v_~z$w_buff1_used~0_234) (= v_~z$r_buff0_thd1~0_112 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_246, ~z$w_buff0~0=v_~z$w_buff0~0_147, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_113, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_245, ~z$w_buff0~0=v_~z$w_buff0~0_146, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_95, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_234, ~z$w_buff1~0=v_~z$w_buff1~0_139, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_45, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_95, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_101, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_112, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [377] L798-->L801: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~x~0_3) InVars {~x~0=v_~x~0_3} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-05 22:53:32,550 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L869-3-->L873: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [431] L847-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 22:53:32,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L869-3-->L873: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [433] L788-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59) (= |v_P0Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_7|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 22:53:32,599 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L869-3-->L873: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [461] L811-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_13|) (= |v_P1Thread1of1ForFork2_#res.base_13| 0) (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 22:53:32,630 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:32,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1360 [2022-12-05 22:53:32,631 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 362 flow [2022-12-05 22:53:32,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:32,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:32,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:32,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:53:32,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:32,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2050001906, now seen corresponding path program 1 times [2022-12-05 22:53:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:32,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431837498] [2022-12-05 22:53:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:32,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431837498] [2022-12-05 22:53:32,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431837498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:32,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:32,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536833565] [2022-12-05 22:53:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:32,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:32,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 33 [2022-12-05 22:53:32,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:32,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:32,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 33 [2022-12-05 22:53:32,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:33,017 INFO L130 PetriNetUnfolder]: 1117/1888 cut-off events. [2022-12-05 22:53:33,017 INFO L131 PetriNetUnfolder]: For 4558/4648 co-relation queries the response was YES. [2022-12-05 22:53:33,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 1888 events. 1117/1888 cut-off events. For 4558/4648 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10028 event pairs, 422 based on Foata normal form. 35/1902 useless extension candidates. Maximal degree in co-relation 6995. Up to 1036 conditions per place. [2022-12-05 22:53:33,023 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 69 selfloop transitions, 2 changer transitions 18/93 dead transitions. [2022-12-05 22:53:33,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 832 flow [2022-12-05 22:53:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:53:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:53:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-05 22:53:33,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2022-12-05 22:53:33,025 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 362 flow. Second operand 4 states and 75 transitions. [2022-12-05 22:53:33,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 832 flow [2022-12-05 22:53:33,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 780 flow, removed 26 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:33,029 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 327 flow [2022-12-05 22:53:33,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-05 22:53:33,030 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2022-12-05 22:53:33,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:33,030 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 327 flow [2022-12-05 22:53:33,030 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:33,030 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:33,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 327 flow [2022-12-05 22:53:33,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 327 flow [2022-12-05 22:53:33,051 INFO L130 PetriNetUnfolder]: 94/290 cut-off events. [2022-12-05 22:53:33,051 INFO L131 PetriNetUnfolder]: For 648/695 co-relation queries the response was YES. [2022-12-05 22:53:33,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 994 conditions, 290 events. 94/290 cut-off events. For 648/695 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1748 event pairs, 37 based on Foata normal form. 4/271 useless extension candidates. Maximal degree in co-relation 969. Up to 104 conditions per place. [2022-12-05 22:53:33,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 47 transitions, 327 flow [2022-12-05 22:53:33,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-05 22:53:33,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L798: Formula: (and (= v_~x~0_12 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_12} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [502] $Ultimate##0-->L801: Formula: (and (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_73| (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_519 256))) (not (= (mod v_~z$w_buff0_used~0_572 256) 0)))) 1 0)) (= v_~z$r_buff0_thd1~0_319 v_~z$r_buff1_thd1~0_235) (= v_~z$w_buff0_used~0_573 v_~z$w_buff1_used~0_519) (= v_~z$r_buff0_thd3~0_241 v_~z$r_buff1_thd3~0_237) (= |v_P0Thread1of1ForFork1_~arg#1.base_71| |v_P0Thread1of1ForFork1_#in~arg#1.base_71|) (= v_~z$r_buff0_thd2~0_141 v_~z$r_buff1_thd2~0_136) (= v_~z$r_buff0_thd0~0_200 v_~z$r_buff1_thd0~0_194) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_73| 0)) (= v_~x~0_57 v_~__unbuffered_p1_EAX~0_91) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_73| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_73|) (= v_~z$r_buff0_thd1~0_318 1) (= v_~z$w_buff0~0_366 1) (= v_~z$w_buff0~0_367 v_~z$w_buff1~0_323) (= |v_P0Thread1of1ForFork1_~arg#1.offset_71| |v_P0Thread1of1ForFork1_#in~arg#1.offset_71|) (= v_~z$w_buff0_used~0_572 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_200, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_71|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_573, ~z$w_buff0~0=v_~z$w_buff0~0_367, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_241, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_71|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_319, ~x~0=v_~x~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_141} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_71|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_572, ~z$w_buff0~0=v_~z$w_buff0~0_366, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_519, ~z$w_buff1~0=v_~z$w_buff1~0_323, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_71|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_71|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_71|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_200, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_73|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_194, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_235, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_241, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_73|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_318, ~x~0=v_~x~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_141} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] [2022-12-05 22:53:33,200 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L798: Formula: (and (= v_~x~0_12 1) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_12} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] and [500] $Ultimate##0-->L801: Formula: (and (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|) (= |v_P0Thread1of1ForFork1_~arg#1.offset_67| |v_P0Thread1of1ForFork1_#in~arg#1.offset_67|) (= |v_P0Thread1of1ForFork1_~arg#1.base_67| |v_P0Thread1of1ForFork1_#in~arg#1.base_67|) (= v_~z$w_buff0~0_358 1) (= v_~x~0_55 v_~__unbuffered_p1_EAX~0_89) (= v_~z$w_buff0_used~0_562 1) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_513 256) 0)) (not (= (mod v_~z$w_buff0_used~0_562 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|) (= v_~z$r_buff0_thd0~0_196 v_~z$r_buff1_thd0~0_190) (= v_~z$r_buff0_thd2~0_137 v_~z$r_buff1_thd2~0_132) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| 0)) (= v_~z$w_buff0_used~0_563 v_~z$w_buff1_used~0_513) (= v_~z$r_buff0_thd3~0_235 v_~z$r_buff1_thd3~0_231) (= v_~z$w_buff0~0_359 v_~z$w_buff1~0_319) (= v_~z$r_buff0_thd1~0_311 v_~z$r_buff1_thd1~0_231) (= v_~z$r_buff0_thd1~0_310 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_563, ~z$w_buff0~0=v_~z$w_buff0~0_359, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_235, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_67|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_311, ~x~0=v_~x~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_137} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_67|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_562, ~z$w_buff0~0=v_~z$w_buff0~0_358, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_231, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_513, ~z$w_buff1~0=v_~z$w_buff1~0_319, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_67|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_67|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_196, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_89, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_190, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_231, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_235, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_310, ~x~0=v_~x~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_137} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] [2022-12-05 22:53:33,330 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] $Ultimate##0-->L801: Formula: (and (= v_~x~0_61 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_15| v_P1Thread1of1ForFork2_~arg.base_15) (= v_~x~0_61 v_~__unbuffered_p1_EAX~0_95) (= |v_P1Thread1of1ForFork2_#in~arg.offset_15| v_P1Thread1of1ForFork2_~arg.offset_15)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_15|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_15, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_15|, ~x~0=v_~x~0_61} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~x~0] and [370] L778-->L781: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-05 22:53:33,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [509] $Ultimate##0-->L801: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_19| v_P1Thread1of1ForFork2_~arg.base_19) (= v_~x~0_65 1) (= v_~x~0_65 v_~__unbuffered_p1_EAX~0_99) (= |v_P1Thread1of1ForFork2_#in~arg.offset_19| v_P1Thread1of1ForFork2_~arg.offset_19)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_19|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_19, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_99, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_19|, ~x~0=v_~x~0_65} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~x~0] and [370] L778-->L781: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-05 22:53:33,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [510] $Ultimate##0-->L801: Formula: (and (= |v_P0Thread1of1ForFork1_~arg#1.base_75| |v_P0Thread1of1ForFork1_#in~arg#1.base_75|) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_77| 0)) (= |v_P1Thread1of1ForFork2_#in~arg.offset_21| v_P1Thread1of1ForFork2_~arg.offset_21) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_535 256) 0)) (not (= (mod v_~z$w_buff0_used~0_592 256) 0)))) 1 0)) (= v_~z$r_buff0_thd3~0_245 v_~z$r_buff1_thd3~0_241) (= v_~x~0_67 v_~__unbuffered_p1_EAX~0_101) (= v_~z$w_buff0_used~0_593 v_~z$w_buff1_used~0_535) (= |v_P1Thread1of1ForFork2_#in~arg.base_21| v_P1Thread1of1ForFork2_~arg.base_21) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_77| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|) (= v_~z$w_buff0~0_379 v_~z$w_buff1~0_331) (= v_~z$r_buff0_thd1~0_335 v_~z$r_buff1_thd1~0_247) (= v_~z$w_buff0_used~0_592 1) (= v_~z$r_buff0_thd0~0_204 v_~z$r_buff1_thd0~0_198) (= v_~z$r_buff0_thd2~0_153 v_~z$r_buff1_thd2~0_148) (= v_~x~0_67 1) (= v_~z$r_buff0_thd1~0_334 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_75| |v_P0Thread1of1ForFork1_#in~arg#1.offset_75|) (= v_~z$w_buff0~0_378 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_593, ~z$w_buff0~0=v_~z$w_buff0~0_379, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_245, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_75|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_335, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_153} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_21, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_75|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_592, ~z$w_buff0~0=v_~z$w_buff0~0_378, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_241, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_148, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_535, ~z$w_buff1~0=v_~z$w_buff1~0_331, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_75|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_75|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_75|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_21|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_101, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_247, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_245, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_77|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_334, ~x~0=v_~x~0_67, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P1Thread1of1ForFork2_~arg.offset, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0, ~x~0] and [370] L778-->L781: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-05 22:53:33,472 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [511] $Ultimate##0-->L801: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.offset_23| v_P1Thread1of1ForFork2_~arg.offset_23) (= v_~x~0_69 v_~__unbuffered_p1_EAX~0_103) (= v_~x~0_69 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_23| v_P1Thread1of1ForFork2_~arg.base_23)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_23|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_23|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_23|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_23, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_23|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0, ~x~0] and [370] L778-->L781: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-05 22:53:33,493 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:33,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-05 22:53:33,494 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 372 flow [2022-12-05 22:53:33,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:33,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:33,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:33,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:53:33,494 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1367405635, now seen corresponding path program 1 times [2022-12-05 22:53:33,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:33,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399738019] [2022-12-05 22:53:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:33,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399738019] [2022-12-05 22:53:33,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399738019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:33,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:33,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832457938] [2022-12-05 22:53:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:33,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:33,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-05 22:53:33,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:33,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:33,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-05 22:53:33,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:33,885 INFO L130 PetriNetUnfolder]: 1348/2313 cut-off events. [2022-12-05 22:53:33,885 INFO L131 PetriNetUnfolder]: For 4777/4787 co-relation queries the response was YES. [2022-12-05 22:53:33,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8404 conditions, 2313 events. 1348/2313 cut-off events. For 4777/4787 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13038 event pairs, 213 based on Foata normal form. 30/2310 useless extension candidates. Maximal degree in co-relation 8376. Up to 1165 conditions per place. [2022-12-05 22:53:33,893 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 58 selfloop transitions, 2 changer transitions 8/72 dead transitions. [2022-12-05 22:53:33,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 600 flow [2022-12-05 22:53:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:53:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:53:33,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-05 22:53:33,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-05 22:53:33,894 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 372 flow. Second operand 4 states and 62 transitions. [2022-12-05 22:53:33,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 600 flow [2022-12-05 22:53:33,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 587 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:33,899 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 305 flow [2022-12-05 22:53:33,899 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2022-12-05 22:53:33,900 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2022-12-05 22:53:33,900 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:33,900 INFO L89 Accepts]: Start accepts. Operand has 59 places, 44 transitions, 305 flow [2022-12-05 22:53:33,900 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:33,901 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:33,901 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 44 transitions, 305 flow [2022-12-05 22:53:33,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 44 transitions, 305 flow [2022-12-05 22:53:33,930 INFO L130 PetriNetUnfolder]: 140/441 cut-off events. [2022-12-05 22:53:33,930 INFO L131 PetriNetUnfolder]: For 887/948 co-relation queries the response was YES. [2022-12-05 22:53:33,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 441 events. 140/441 cut-off events. For 887/948 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3098 event pairs, 66 based on Foata normal form. 3/401 useless extension candidates. Maximal degree in co-relation 1392. Up to 185 conditions per place. [2022-12-05 22:53:33,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 44 transitions, 305 flow [2022-12-05 22:53:33,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-05 22:53:33,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:33,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-05 22:53:33,971 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 311 flow [2022-12-05 22:53:33,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:33,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:33,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:33,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:53:33,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1099668449, now seen corresponding path program 1 times [2022-12-05 22:53:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:33,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655283528] [2022-12-05 22:53:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:34,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655283528] [2022-12-05 22:53:34,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655283528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:34,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:34,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745065228] [2022-12-05 22:53:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:34,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:53:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:53:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:53:34,082 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 22:53:34,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:34,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:34,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 22:53:34,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:34,313 INFO L130 PetriNetUnfolder]: 769/1466 cut-off events. [2022-12-05 22:53:34,313 INFO L131 PetriNetUnfolder]: For 2300/2326 co-relation queries the response was YES. [2022-12-05 22:53:34,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 1466 events. 769/1466 cut-off events. For 2300/2326 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8640 event pairs, 141 based on Foata normal form. 172/1599 useless extension candidates. Maximal degree in co-relation 5113. Up to 476 conditions per place. [2022-12-05 22:53:34,318 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 60 selfloop transitions, 10 changer transitions 23/100 dead transitions. [2022-12-05 22:53:34,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 100 transitions, 771 flow [2022-12-05 22:53:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-05 22:53:34,320 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-05 22:53:34,320 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 311 flow. Second operand 6 states and 108 transitions. [2022-12-05 22:53:34,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 100 transitions, 771 flow [2022-12-05 22:53:34,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:34,324 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 371 flow [2022-12-05 22:53:34,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2022-12-05 22:53:34,325 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2022-12-05 22:53:34,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:34,325 INFO L89 Accepts]: Start accepts. Operand has 66 places, 48 transitions, 371 flow [2022-12-05 22:53:34,326 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:34,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:34,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 48 transitions, 371 flow [2022-12-05 22:53:34,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 48 transitions, 371 flow [2022-12-05 22:53:34,349 INFO L130 PetriNetUnfolder]: 93/359 cut-off events. [2022-12-05 22:53:34,349 INFO L131 PetriNetUnfolder]: For 1022/1103 co-relation queries the response was YES. [2022-12-05 22:53:34,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 359 events. 93/359 cut-off events. For 1022/1103 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2451 event pairs, 18 based on Foata normal form. 10/354 useless extension candidates. Maximal degree in co-relation 1426. Up to 172 conditions per place. [2022-12-05 22:53:34,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 48 transitions, 371 flow [2022-12-05 22:53:34,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-05 22:53:34,355 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L869-3-->L873: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [461] L811-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_13|) (= |v_P1Thread1of1ForFork2_#res.base_13| 0) (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 22:53:34,379 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] L869-3-->L873: Formula: (and (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_65) 1 0) 0) 0 1) v_~main$tmp_guard0~0_18) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [433] L788-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59) (= |v_P0Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_7|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] [2022-12-05 22:53:34,737 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:34,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 413 [2022-12-05 22:53:34,738 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 367 flow [2022-12-05 22:53:34,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:34,739 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:34,739 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:53:34,739 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -497150817, now seen corresponding path program 1 times [2022-12-05 22:53:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:34,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296598623] [2022-12-05 22:53:34,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:34,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:34,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296598623] [2022-12-05 22:53:34,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296598623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:34,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:34,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:53:34,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111752431] [2022-12-05 22:53:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:34,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:53:34,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:53:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:53:34,886 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-05 22:53:34,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:34,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:34,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-05 22:53:34,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:35,091 INFO L130 PetriNetUnfolder]: 505/1000 cut-off events. [2022-12-05 22:53:35,091 INFO L131 PetriNetUnfolder]: For 2613/2627 co-relation queries the response was YES. [2022-12-05 22:53:35,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4182 conditions, 1000 events. 505/1000 cut-off events. For 2613/2627 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5563 event pairs, 128 based on Foata normal form. 43/1013 useless extension candidates. Maximal degree in co-relation 4149. Up to 327 conditions per place. [2022-12-05 22:53:35,096 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 32 selfloop transitions, 10 changer transitions 34/80 dead transitions. [2022-12-05 22:53:35,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 680 flow [2022-12-05 22:53:35,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:53:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:53:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-12-05 22:53:35,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41596638655462187 [2022-12-05 22:53:35,097 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 367 flow. Second operand 7 states and 99 transitions. [2022-12-05 22:53:35,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 680 flow [2022-12-05 22:53:35,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 603 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-05 22:53:35,106 INFO L231 Difference]: Finished difference. Result has 67 places, 29 transitions, 198 flow [2022-12-05 22:53:35,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=67, PETRI_TRANSITIONS=29} [2022-12-05 22:53:35,107 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2022-12-05 22:53:35,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:35,107 INFO L89 Accepts]: Start accepts. Operand has 67 places, 29 transitions, 198 flow [2022-12-05 22:53:35,108 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:35,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:35,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 29 transitions, 198 flow [2022-12-05 22:53:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 29 transitions, 198 flow [2022-12-05 22:53:35,113 INFO L130 PetriNetUnfolder]: 7/42 cut-off events. [2022-12-05 22:53:35,114 INFO L131 PetriNetUnfolder]: For 69/76 co-relation queries the response was YES. [2022-12-05 22:53:35,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 42 events. 7/42 cut-off events. For 69/76 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 1 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 145. Up to 11 conditions per place. [2022-12-05 22:53:35,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 29 transitions, 198 flow [2022-12-05 22:53:35,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-05 22:53:35,948 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 22:53:35,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 842 [2022-12-05 22:53:35,949 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 22 transitions, 180 flow [2022-12-05 22:53:35,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:35,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:35,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:35,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:53:35,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2068304167, now seen corresponding path program 1 times [2022-12-05 22:53:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:35,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912662380] [2022-12-05 22:53:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912662380] [2022-12-05 22:53:36,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912662380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:36,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:36,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:53:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858924395] [2022-12-05 22:53:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:36,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:53:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:53:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:53:36,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 22:53:36,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 22 transitions, 180 flow. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:36,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:36,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 22:53:36,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:36,807 INFO L130 PetriNetUnfolder]: 118/239 cut-off events. [2022-12-05 22:53:36,807 INFO L131 PetriNetUnfolder]: For 713/713 co-relation queries the response was YES. [2022-12-05 22:53:36,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 239 events. 118/239 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 891 event pairs, 26 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 1041. Up to 112 conditions per place. [2022-12-05 22:53:36,808 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 26 selfloop transitions, 4 changer transitions 23/53 dead transitions. [2022-12-05 22:53:36,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 479 flow [2022-12-05 22:53:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-05 22:53:36,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 22:53:36,809 INFO L175 Difference]: Start difference. First operand has 53 places, 22 transitions, 180 flow. Second operand 6 states and 40 transitions. [2022-12-05 22:53:36,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 479 flow [2022-12-05 22:53:36,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 343 flow, removed 39 selfloop flow, removed 18 redundant places. [2022-12-05 22:53:36,811 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 134 flow [2022-12-05 22:53:36,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2022-12-05 22:53:36,812 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2022-12-05 22:53:36,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:36,812 INFO L89 Accepts]: Start accepts. Operand has 43 places, 24 transitions, 134 flow [2022-12-05 22:53:36,812 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:36,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:36,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 24 transitions, 134 flow [2022-12-05 22:53:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 134 flow [2022-12-05 22:53:36,817 INFO L130 PetriNetUnfolder]: 11/47 cut-off events. [2022-12-05 22:53:36,817 INFO L131 PetriNetUnfolder]: For 53/59 co-relation queries the response was YES. [2022-12-05 22:53:36,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 47 events. 11/47 cut-off events. For 53/59 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 122 event pairs, 1 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 128. Up to 14 conditions per place. [2022-12-05 22:53:36,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 134 flow [2022-12-05 22:53:36,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-05 22:53:36,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L781: Formula: (let ((.cse1 (= (mod v_~z$w_buff0_used~0_618 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_134 256) 0)))) (and (= v_~z$w_buff1_used~0_555 (ite .cse0 v_~z$w_buff0_used~0_619 (ite .cse1 v_~z$w_buff0_used~0_619 0))) (= v_~z$r_buff1_thd1~0_263 (ite .cse0 v_~z$r_buff0_thd1~0_357 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd1~0_356 256) 0))) (or (and .cse2 (= (mod v_~z$w_buff1_used~0_555 256) 0)) .cse1 (and (= (mod v_~z$r_buff0_thd1~0_357 256) 0) .cse2))) v_~z$r_buff0_thd1~0_357 0))) (= v_~weak$$choice2~0_134 |v_P0Thread1of1ForFork1_#t~nondet4#1_70|) (= |v_P0Thread1of1ForFork1_#t~nondet3#1_70| v_~weak$$choice0~0_90) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_83| (ite (= (mod v_~z$w_buff0_used~0_619 256) 0) 1 0)) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_83| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_83|) (= v_~z$w_buff0~0_401 v_~z$w_buff1~0_347) (= v_~z$r_buff0_thd2~0_159 v_~z$r_buff1_thd2~0_154) (= |v_P0Thread1of1ForFork1_~arg#1.offset_81| |v_P0Thread1of1ForFork1_#in~arg#1.offset_81|) (= v_~z$r_buff0_thd0~0_210 v_~z$r_buff1_thd0~0_204) (= v_~__unbuffered_p0_EAX~0_116 1) (= v_~z$flush_delayed~0_118 0) (= v_~z$r_buff0_thd1~0_356 (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1)))) (= v_~z$w_buff0~0_400 1) (= v_~__unbuffered_p0_EBX~0_100 v_~x~0_83) (= |v_P0Thread1of1ForFork1_~arg#1.base_81| |v_P0Thread1of1ForFork1_#in~arg#1.base_81|) (= v_~z$r_buff0_thd3~0_259 v_~z$r_buff1_thd3~0_255) (= v_~z~0_464 v_~z$mem_tmp~0_114) (= (ite .cse0 v_~z$mem_tmp~0_114 v_~__unbuffered_p0_EAX~0_116) v_~z~0_463) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_83| 0)) (= v_~z$w_buff0_used~0_618 (ite .cse0 1 0)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_210, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_81|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_619, ~z$w_buff0~0=v_~z$w_buff0~0_401, P0Thread1of1ForFork1_#t~nondet4#1=|v_P0Thread1of1ForFork1_#t~nondet4#1_70|, P0Thread1of1ForFork1_#t~nondet3#1=|v_P0Thread1of1ForFork1_#t~nondet3#1_70|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_259, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_81|, ~z~0=v_~z~0_464, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_357, ~x~0=v_~x~0_83, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_159} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_347, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_81|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_81|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_210, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_83|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_204, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_83|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_159, ~z$mem_tmp~0=v_~z$mem_tmp~0_114, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_100, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_81|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_618, ~z$w_buff0~0=v_~z$w_buff0~0_400, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_255, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_555, ~z$flush_delayed~0=v_~z$flush_delayed~0_118, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_81|, ~weak$$choice0~0=v_~weak$$choice0~0_90, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_263, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_259, ~z~0=v_~z~0_463, ~weak$$choice2~0=v_~weak$$choice2~0_134, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_356, ~x~0=v_~x~0_83} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork1_#t~nondet4#1, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1_~arg#1.base, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3#1, ~z~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~weak$$choice2~0, ~z$r_buff0_thd1~0] and [524] $Ultimate##0-->L804: Formula: (and (= v_~x~0_85 v_~__unbuffered_p1_EAX~0_117) (= v_~__unbuffered_p1_EBX~0_92 v_~y~0_59) (= |v_P1Thread1of1ForFork2_#in~arg.base_37| v_P1Thread1of1ForFork2_~arg.base_37) (= |v_P1Thread1of1ForFork2_#in~arg.offset_37| v_P1Thread1of1ForFork2_~arg.offset_37) (= v_~x~0_85 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_37|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_37|, ~y~0=v_~y~0_59} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_37|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_37, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_117, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_37|, ~y~0=v_~y~0_59, ~x~0=v_~x~0_85} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x~0] [2022-12-05 22:53:37,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L804: Formula: (let ((.cse2 (= (mod v_~z$w_buff0_used~0_646 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_142 256) 0)))) (and (= v_~__unbuffered_p1_EBX~0_98 v_~y~0_69) (= |v_P0Thread1of1ForFork1_#t~nondet3#1_74| v_~weak$$choice0~0_98) (= |v_P1Thread1of1ForFork2_#in~arg.base_39| v_P1Thread1of1ForFork2_~arg.base_39) (= |v_P0Thread1of1ForFork1_~arg#1.offset_83| |v_P0Thread1of1ForFork1_#in~arg#1.offset_83|) (= v_~z$r_buff0_thd0~0_220 v_~z$r_buff1_thd0~0_214) (= v_~z$w_buff0~0_421 v_~z$w_buff1~0_365) (= |v_P0Thread1of1ForFork1_~arg#1.base_83| |v_P0Thread1of1ForFork1_#in~arg#1.base_83|) (= v_~z$r_buff0_thd3~0_273 v_~z$r_buff1_thd3~0_269) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_85| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_85|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_39| v_P1Thread1of1ForFork2_~arg.offset_39) (= v_~z$r_buff1_thd1~0_273 (ite .cse0 v_~z$r_buff0_thd1~0_369 (ite (let ((.cse1 (= 0 (mod v_~z$r_buff0_thd1~0_368 256)))) (or (and .cse1 (= (mod v_~z$w_buff1_used~0_581 256) 0)) .cse2 (and .cse1 (= (mod v_~z$r_buff0_thd1~0_369 256) 0)))) v_~z$r_buff0_thd1~0_369 0))) (= v_~z$flush_delayed~0_126 0) (= v_~z$r_buff0_thd1~0_368 (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1)))) (= (ite (= (mod v_~z$w_buff0_used~0_647 256) 0) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_85|) (= v_~x~0_87 v_~__unbuffered_p1_EAX~0_123) (= v_~__unbuffered_p0_EBX~0_106 v_~x~0_88) (= v_~weak$$choice2~0_142 |v_P0Thread1of1ForFork1_#t~nondet4#1_74|) (= v_~__unbuffered_p0_EAX~0_122 1) (= v_~z~0_491 (ite .cse0 v_~z$mem_tmp~0_122 v_~__unbuffered_p0_EAX~0_122)) (= v_~x~0_87 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_85| 0)) (= v_~z$r_buff0_thd2~0_161 v_~z$r_buff1_thd2~0_156) (= v_~z$w_buff0~0_420 1) (= v_~z$w_buff1_used~0_581 (ite .cse0 v_~z$w_buff0_used~0_647 (ite .cse2 v_~z$w_buff0_used~0_647 0))) (= (ite .cse0 1 0) v_~z$w_buff0_used~0_646) (= v_~z~0_492 v_~z$mem_tmp~0_122))) InVars {P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_83|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_647, ~z$w_buff0~0=v_~z$w_buff0~0_421, P0Thread1of1ForFork1_#t~nondet4#1=|v_P0Thread1of1ForFork1_#t~nondet4#1_74|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_83|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_220, P0Thread1of1ForFork1_#t~nondet3#1=|v_P0Thread1of1ForFork1_#t~nondet3#1_74|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_273, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_39|, ~z~0=v_~z~0_492, ~y~0=v_~y~0_69, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_369, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_161, ~x~0=v_~x~0_88} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_156, ~z$w_buff1~0=v_~z$w_buff1~0_365, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_83|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_83|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_39|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_122, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_220, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_123, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_85|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_214, ~y~0=v_~y~0_69, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_85|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_161, ~z$mem_tmp~0=v_~z$mem_tmp~0_122, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_39, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_98, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_106, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_83|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_646, ~z$w_buff0~0=v_~z$w_buff0~0_420, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_269, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_581, ~z$flush_delayed~0=v_~z$flush_delayed~0_126, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_83|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_39, ~weak$$choice0~0=v_~weak$$choice0~0_98, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_273, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_273, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_39|, ~z~0=v_~z~0_491, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_368, ~x~0=v_~x~0_87} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$mem_tmp~0, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork1_#t~nondet4#1, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, P0Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3#1, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] and [528] $Ultimate##0-->L840: Formula: (let ((.cse3 (= (mod v_~z$r_buff1_thd3~0_258 256) 0)) (.cse8 (= (mod v_~z$r_buff0_thd3~0_262 256) 0))) (let ((.cse9 (not .cse8)) (.cse6 (and .cse3 .cse8)) (.cse7 (and .cse8 (= (mod v_~z$w_buff1_used~0_566 256) 0))) (.cse12 (= (mod v_~z$w_buff0_used~0_631 256) 0))) (let ((.cse10 (or .cse6 .cse7 .cse12)) (.cse11 (and (not .cse12) .cse9))) (let ((.cse5 (= (mod v_~z$w_buff1_used~0_565 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_630 256) 0)) (.cse0 (ite .cse10 v_~z~0_476 (ite .cse11 v_~z$w_buff0~0_409 v_~z$w_buff1~0_354))) (.cse1 (not (= (mod v_~weak$$choice2~0_136 256) 0)))) (and (= v_~__unbuffered_p2_EBX~0_120 .cse0) (= v_~y~0_63 v_~__unbuffered_p2_EAX~0_90) (= v_~z$r_buff1_thd3~0_257 (ite .cse1 v_~z$r_buff1_thd3~0_258 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_261 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse2))) v_~z$r_buff1_thd3~0_258 0))) (= v_~z$w_buff0~0_409 v_~z$w_buff0~0_408) (= v_~z~0_476 v_~z$mem_tmp~0_116) (= v_~z$flush_delayed~0_120 0) (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= v_~z$w_buff1_used~0_565 (ite .cse1 v_~z$w_buff1_used~0_566 (ite (or .cse6 .cse4 .cse7) v_~z$w_buff1_used~0_566 0))) (= v_~y~0_63 1) (= v_~z$r_buff0_thd3~0_261 (ite .cse1 v_~z$r_buff0_thd3~0_262 (ite (or .cse6 .cse4 (and .cse5 .cse8)) v_~z$r_buff0_thd3~0_262 (ite (and .cse9 (not .cse4)) 0 v_~z$r_buff0_thd3~0_262)))) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~z~0_475 (ite .cse1 v_~z$mem_tmp~0_116 .cse0)) (= v_~z$w_buff0_used~0_630 (ite .cse1 v_~z$w_buff0_used~0_631 (ite .cse10 v_~z$w_buff0_used~0_631 (ite .cse11 0 v_~z$w_buff0_used~0_631)))) (= v_~weak$$choice0~0_92 |v_P2Thread1of1ForFork0_#t~nondet5_66|) (= v_~z$w_buff1~0_354 v_~z$w_buff1~0_353) (= v_~weak$$choice2~0_136 |v_P2Thread1of1ForFork0_#t~nondet6_66|)))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_631, ~z$w_buff0~0=v_~z$w_buff0~0_409, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_258, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_566, ~z$w_buff1~0=v_~z$w_buff1~0_354, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_262, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_66|, ~z~0=v_~z~0_476, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_66|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_116, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_408, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_257, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_565, ~z$w_buff1~0=v_~z$w_buff1~0_353, ~z$flush_delayed~0=v_~z$flush_delayed~0_120, ~weak$$choice0~0=v_~weak$$choice0~0_92, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_261, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~z~0=v_~z~0_475, ~weak$$choice2~0=v_~weak$$choice2~0_136, ~y~0=v_~y~0_63, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet6, ~z$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, P2Thread1of1ForFork0_~arg.base, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, ~y~0] [2022-12-05 22:53:38,084 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:53:38,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1272 [2022-12-05 22:53:38,085 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 132 flow [2022-12-05 22:53:38,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:38,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:38,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:53:38,085 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -644197051, now seen corresponding path program 1 times [2022-12-05 22:53:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:38,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276031764] [2022-12-05 22:53:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:38,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276031764] [2022-12-05 22:53:38,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276031764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:38,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:38,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39713147] [2022-12-05 22:53:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:38,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:53:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:38,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:53:38,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:53:38,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-05 22:53:38,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 132 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:38,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-05 22:53:38,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:38,834 INFO L130 PetriNetUnfolder]: 60/124 cut-off events. [2022-12-05 22:53:38,834 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-05 22:53:38,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 124 events. 60/124 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 384 event pairs, 2 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 453. Up to 69 conditions per place. [2022-12-05 22:53:38,835 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 26 selfloop transitions, 4 changer transitions 13/43 dead transitions. [2022-12-05 22:53:38,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 320 flow [2022-12-05 22:53:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-12-05 22:53:38,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-05 22:53:38,836 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 132 flow. Second operand 6 states and 30 transitions. [2022-12-05 22:53:38,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 320 flow [2022-12-05 22:53:38,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 294 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-05 22:53:38,837 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 121 flow [2022-12-05 22:53:38,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-05 22:53:38,837 INFO L294 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2022-12-05 22:53:38,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:38,837 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 121 flow [2022-12-05 22:53:38,838 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:38,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:38,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 121 flow [2022-12-05 22:53:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 121 flow [2022-12-05 22:53:38,842 INFO L130 PetriNetUnfolder]: 9/36 cut-off events. [2022-12-05 22:53:38,842 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-05 22:53:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 36 events. 9/36 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 99. Up to 12 conditions per place. [2022-12-05 22:53:38,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 121 flow [2022-12-05 22:53:38,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-05 22:53:38,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:38,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 22:53:38,858 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 121 flow [2022-12-05 22:53:38,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:38,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:38,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:53:38,859 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -575080757, now seen corresponding path program 2 times [2022-12-05 22:53:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:38,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493243441] [2022-12-05 22:53:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:38,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:53:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:38,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:53:38,932 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:53:38,933 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 22:53:38,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 22:53:38,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 22:53:38,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 22:53:38,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 22:53:38,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 22:53:38,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 22:53:38,934 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:38,938 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:53:38,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:53:38,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:53:38 BasicIcfg [2022-12-05 22:53:38,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:53:38,972 INFO L158 Benchmark]: Toolchain (without parser) took 16872.48ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 167.9MB in the beginning and 606.9MB in the end (delta: -439.0MB). Peak memory consumption was 387.7MB. Max. memory is 8.0GB. [2022-12-05 22:53:38,972 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:53:38,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.30ms. Allocated memory is still 191.9MB. Free memory was 167.3MB in the beginning and 139.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:53:38,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.11ms. Allocated memory is still 191.9MB. Free memory was 139.0MB in the beginning and 136.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:38,973 INFO L158 Benchmark]: Boogie Preprocessor took 34.96ms. Allocated memory is still 191.9MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:38,973 INFO L158 Benchmark]: RCFGBuilder took 597.80ms. Allocated memory is still 191.9MB. Free memory was 134.4MB in the beginning and 92.9MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2022-12-05 22:53:38,973 INFO L158 Benchmark]: TraceAbstraction took 15673.48ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 91.8MB in the beginning and 606.9MB in the end (delta: -515.1MB). Peak memory consumption was 311.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:38,974 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.09ms. Allocated memory is still 191.9MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 497.30ms. Allocated memory is still 191.9MB. Free memory was 167.3MB in the beginning and 139.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.11ms. Allocated memory is still 191.9MB. Free memory was 139.0MB in the beginning and 136.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.96ms. Allocated memory is still 191.9MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 597.80ms. Allocated memory is still 191.9MB. Free memory was 134.4MB in the beginning and 92.9MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 15673.48ms. Allocated memory was 191.9MB in the beginning and 1.0GB in the end (delta: 825.2MB). Free memory was 91.8MB in the beginning and 606.9MB in the end (delta: -515.1MB). Peak memory consumption was 311.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 120 PlacesBefore, 40 PlacesAfterwards, 112 TransitionsBefore, 31 TransitionsAfterwards, 2230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1970, independent: 1903, independent conditional: 1903, independent unconditional: 0, dependent: 67, dependent conditional: 67, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1970, independent: 1903, independent conditional: 0, independent unconditional: 1903, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1970, independent: 1903, independent conditional: 0, independent unconditional: 1903, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1970, independent: 1903, independent conditional: 0, independent unconditional: 1903, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1489, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1489, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 211, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1970, independent: 464, independent conditional: 0, independent unconditional: 464, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1489, unknown conditional: 0, unknown unconditional: 1489] , Statistics on independence cache: Total cache size (in pairs): 2343, Positive cache size: 2293, Positive conditional cache size: 0, Positive unconditional cache size: 2293, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, independent: 153, independent conditional: 153, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 181, independent: 153, independent conditional: 22, independent unconditional: 131, dependent: 28, dependent conditional: 9, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 181, independent: 153, independent conditional: 22, independent unconditional: 131, dependent: 28, dependent conditional: 9, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 181, independent: 153, independent conditional: 22, independent unconditional: 131, dependent: 28, dependent conditional: 9, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 19, independent unconditional: 109, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 152, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 73, dependent conditional: 32, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, independent: 25, independent conditional: 3, independent unconditional: 22, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 152, unknown conditional: 27, unknown unconditional: 125] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 128, Positive conditional cache size: 19, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 8, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 139, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 139, independent: 116, independent conditional: 12, independent unconditional: 104, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 147, Positive conditional cache size: 19, Positive unconditional cache size: 128, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, independent: 198, independent conditional: 198, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 227, independent: 198, independent conditional: 94, independent unconditional: 104, dependent: 29, dependent conditional: 14, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, independent: 198, independent conditional: 75, independent unconditional: 123, dependent: 29, dependent conditional: 8, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, independent: 198, independent conditional: 75, independent unconditional: 123, dependent: 29, dependent conditional: 8, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 53, dependent conditional: 33, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, independent: 181, independent conditional: 74, independent unconditional: 107, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 23, unknown conditional: 3, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 164, Positive conditional cache size: 20, Positive unconditional cache size: 144, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 134, independent conditional: 68, independent unconditional: 66, dependent: 28, dependent conditional: 14, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 134, independent conditional: 44, independent unconditional: 90, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 134, independent conditional: 44, independent unconditional: 90, dependent: 28, dependent conditional: 8, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 162, independent: 131, independent conditional: 44, independent unconditional: 87, dependent: 26, dependent conditional: 8, dependent unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 167, Positive conditional cache size: 20, Positive unconditional cache size: 147, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 215, independent: 187, independent conditional: 187, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 215, independent: 187, independent conditional: 85, independent unconditional: 102, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 215, independent: 187, independent conditional: 60, independent unconditional: 127, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 215, independent: 187, independent conditional: 60, independent unconditional: 127, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 215, independent: 185, independent conditional: 60, independent unconditional: 125, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 169, Positive conditional cache size: 20, Positive unconditional cache size: 149, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 150, independent conditional: 73, independent unconditional: 77, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 150, independent conditional: 35, independent unconditional: 115, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 150, independent conditional: 35, independent unconditional: 115, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, independent: 149, independent conditional: 35, independent unconditional: 114, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 170, Positive conditional cache size: 20, Positive unconditional cache size: 150, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 55 PlacesBefore, 53 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371, independent: 321, independent conditional: 321, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 371, independent: 321, independent conditional: 189, independent unconditional: 132, dependent: 50, dependent conditional: 16, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371, independent: 321, independent conditional: 156, independent unconditional: 165, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371, independent: 321, independent conditional: 156, independent unconditional: 165, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 371, independent: 316, independent conditional: 151, independent unconditional: 165, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 254, Positive conditional cache size: 27, Positive unconditional cache size: 227, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 49, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 56 PlacesBefore, 56 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 448, independent: 414, independent conditional: 189, independent unconditional: 225, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 448, independent: 414, independent conditional: 155, independent unconditional: 259, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 448, independent: 414, independent conditional: 155, independent unconditional: 259, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 6, independent unconditional: 8, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 448, independent: 400, independent conditional: 149, independent unconditional: 251, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 412, Positive conditional cache size: 43, Positive unconditional cache size: 369, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 16, independent unconditional: 16, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 10, independent unconditional: 22, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 491, Positive conditional cache size: 47, Positive unconditional cache size: 444, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 66 PlacesBefore, 64 PlacesAfterwards, 48 TransitionsBefore, 46 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 38, independent conditional: 34, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 38, independent conditional: 34, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 58, independent: 35, independent conditional: 31, independent unconditional: 4, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 546, Positive conditional cache size: 51, Positive unconditional cache size: 495, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 61 PlacesBefore, 53 PlacesAfterwards, 29 TransitionsBefore, 22 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 120, independent conditional: 77, independent unconditional: 43, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 120, independent conditional: 62, independent unconditional: 58, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 120, independent conditional: 62, independent unconditional: 58, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 12, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 107, independent conditional: 50, independent unconditional: 57, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 17, unknown conditional: 12, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 675, Positive conditional cache size: 69, Positive unconditional cache size: 606, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 41 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 683, Positive conditional cache size: 71, Positive unconditional cache size: 612, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 732, Positive cache size: 687, Positive conditional cache size: 75, Positive unconditional cache size: 612, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t14, ((void *)0), P0, ((void *)0))=-1, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t15; [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t15, ((void *)0), P1, ((void *)0))=0, t14={5:0}, t15={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t16; [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t16, ((void *)0), P2, ((void *)0))=1, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 [L780] 1 __unbuffered_p0_EBX = x [L797] 1 x = 1 [L800] 1 __unbuffered_p1_EAX = x [L803] 1 __unbuffered_p1_EBX = y [L806] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 2 return 0; [L820] 3 y = 1 [L823] 3 __unbuffered_p2_EAX = y [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 385 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1232 IncrementalHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 26 mSDtfsCounter, 1232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:53:38,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...