/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/mix046.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:04:41,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:04:41,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:04:41,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:04:41,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:04:41,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:04:41,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:04:41,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:04:41,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:04:41,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:04:41,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:04:41,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:04:41,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:04:41,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:04:41,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:04:41,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:04:41,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:04:41,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:04:41,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:04:41,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:04:41,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:04:41,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:04:41,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:04:41,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:04:41,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:04:41,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:04:41,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:04:41,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:04:41,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:04:41,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:04:41,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:04:41,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:04:41,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:04:41,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:04:41,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:04:41,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:04:41,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:04:41,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:04:41,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:04:41,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:04:41,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:04:41,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:04:41,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:04:41,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:04:41,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:04:41,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:04:41,773 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:04:41,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:04:41,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:04:41,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:04:41,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:04:41,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:04:41,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:04:41,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:04:41,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:04:41,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:04:41,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:04:41,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:04:41,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:04:41,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:04:41,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:04:41,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:04:41,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:04:42,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:04:42,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:04:42,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:04:42,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:04:42,051 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:04:42,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-12-05 23:04:43,025 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:04:43,286 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:04:43,287 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2022-12-05 23:04:43,308 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f791b125a/0a7e2ad3cb904d3b99d9062a35d67d9f/FLAG038b90781 [2022-12-05 23:04:43,318 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f791b125a/0a7e2ad3cb904d3b99d9062a35d67d9f [2022-12-05 23:04:43,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:04:43,321 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:04:43,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:04:43,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:04:43,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:04:43,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322a7dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43, skipping insertion in model container [2022-12-05 23:04:43,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:04:43,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:04:43,487 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/mix046.opt.i[944,957] [2022-12-05 23:04:43,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:04:43,635 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:04:43,653 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/mix046.opt.i[944,957] [2022-12-05 23:04:43,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:04:43,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:04:43,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:04:43,753 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:04:43,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43 WrapperNode [2022-12-05 23:04:43,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:04:43,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:04:43,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:04:43,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:04:43,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,820 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-12-05 23:04:43,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:04:43,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:04:43,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:04:43,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:04:43,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,851 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:04:43,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:04:43,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:04:43,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:04:43,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (1/1) ... [2022-12-05 23:04:43,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:04:43,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:04:43,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:04:43,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:04:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:04:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:04:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:04:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:04:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:04:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:04:43,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:04:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:04:43,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:04:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:04:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:04:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:04:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:04:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:04:43,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:04:43,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:04:43,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:04:43,988 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:04:44,127 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:04:44,129 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:04:44,325 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:04:44,435 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:04:44,436 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:04:44,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:04:44 BoogieIcfgContainer [2022-12-05 23:04:44,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:04:44,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:04:44,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:04:44,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:04:44,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:04:43" (1/3) ... [2022-12-05 23:04:44,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6572de60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:04:44, skipping insertion in model container [2022-12-05 23:04:44,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:04:43" (2/3) ... [2022-12-05 23:04:44,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6572de60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:04:44, skipping insertion in model container [2022-12-05 23:04:44,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:04:44" (3/3) ... [2022-12-05 23:04:44,445 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-12-05 23:04:44,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:04:44,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:04:44,458 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:04:44,509 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:04:44,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-05 23:04:44,614 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-05 23:04:44,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:44,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:04:44,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-05 23:04:44,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-05 23:04:44,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:44,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-05 23:04:44,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-05 23:04:44,682 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-05 23:04:44,682 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:44,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 23:04:44,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-05 23:04:44,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 2936 [2022-12-05 23:04:49,379 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-05 23:04:49,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:04:49,393 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;@7bec3ead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:04:49,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 23:04:49,397 INFO L130 PetriNetUnfolder]: 1/19 cut-off events. [2022-12-05 23:04:49,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:49,397 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:49,397 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:49,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1196429622, now seen corresponding path program 1 times [2022-12-05 23:04:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:49,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112190644] [2022-12-05 23:04:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:49,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112190644] [2022-12-05 23:04:49,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112190644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:49,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:49,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:04:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584542408] [2022-12-05 23:04:49,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:49,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:49,809 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:04:49,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:49,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:49,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:04:49,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:50,330 INFO L130 PetriNetUnfolder]: 3113/4531 cut-off events. [2022-12-05 23:04:50,331 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-05 23:04:50,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8925 conditions, 4531 events. 3113/4531 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24507 event pairs, 593 based on Foata normal form. 0/4158 useless extension candidates. Maximal degree in co-relation 8913. Up to 3385 conditions per place. [2022-12-05 23:04:50,352 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-05 23:04:50,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-12-05 23:04:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 23:04:50,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-05 23:04:50,360 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-05 23:04:50,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-12-05 23:04:50,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:04:50,365 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2022-12-05 23:04:50,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 23:04:50,369 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-05 23:04:50,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:50,370 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 64 flow [2022-12-05 23:04:50,372 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:50,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:50,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 64 flow [2022-12-05 23:04:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-05 23:04:50,383 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-05 23:04:50,383 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:50,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:04:50,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-05 23:04:50,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 23:04:50,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:50,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-05 23:04:50,548 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 62 flow [2022-12-05 23:04:50,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:50,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:50,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:50,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:04:50,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:50,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1282367066, now seen corresponding path program 1 times [2022-12-05 23:04:50,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:50,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414438765] [2022-12-05 23:04:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:50,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414438765] [2022-12-05 23:04:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414438765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:50,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:04:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144720845] [2022-12-05 23:04:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:50,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:04:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:04:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:04:50,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-05 23:04:50,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:50,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:50,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-05 23:04:50,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:50,988 INFO L130 PetriNetUnfolder]: 1556/2326 cut-off events. [2022-12-05 23:04:50,988 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-05 23:04:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 2326 events. 1556/2326 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11645 event pairs, 440 based on Foata normal form. 36/2349 useless extension candidates. Maximal degree in co-relation 4719. Up to 1621 conditions per place. [2022-12-05 23:04:51,001 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 28 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-05 23:04:51,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 140 flow [2022-12-05 23:04:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:04:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:04:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 23:04:51,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-05 23:04:51,003 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 62 flow. Second operand 3 states and 43 transitions. [2022-12-05 23:04:51,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 140 flow [2022-12-05 23:04:51,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:51,005 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:51,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-05 23:04:51,005 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -6 predicate places. [2022-12-05 23:04:51,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:51,006 INFO L89 Accepts]: Start accepts. Operand has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:51,006 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:51,006 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:51,006 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:51,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:51,010 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-05 23:04:51,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:04:51,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 25 events. 0/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:04:51,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:51,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-05 23:04:51,023 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:51,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-05 23:04:51,025 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2022-12-05 23:04:51,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:51,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:51,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:51,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:04:51,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1098672637, now seen corresponding path program 1 times [2022-12-05 23:04:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:51,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708108383] [2022-12-05 23:04:51,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:51,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:51,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708108383] [2022-12-05 23:04:51,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708108383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:51,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:51,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:04:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011342299] [2022-12-05 23:04:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:51,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:04:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:51,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:04:51,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:04:51,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:04:51,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:51,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:51,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:04:51,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:51,961 INFO L130 PetriNetUnfolder]: 6465/8954 cut-off events. [2022-12-05 23:04:51,962 INFO L131 PetriNetUnfolder]: For 792/792 co-relation queries the response was YES. [2022-12-05 23:04:51,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19187 conditions, 8954 events. 6465/8954 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 44099 event pairs, 453 based on Foata normal form. 192/9146 useless extension candidates. Maximal degree in co-relation 19176. Up to 6521 conditions per place. [2022-12-05 23:04:51,993 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 48 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2022-12-05 23:04:51,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 266 flow [2022-12-05 23:04:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-05 23:04:51,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-05 23:04:51,996 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 4 states and 61 transitions. [2022-12-05 23:04:51,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 266 flow [2022-12-05 23:04:51,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:51,999 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 133 flow [2022-12-05 23:04:51,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-05 23:04:52,000 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-05 23:04:52,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:52,000 INFO L89 Accepts]: Start accepts. Operand has 40 places, 34 transitions, 133 flow [2022-12-05 23:04:52,001 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:52,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:52,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 133 flow [2022-12-05 23:04:52,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 133 flow [2022-12-05 23:04:52,040 INFO L130 PetriNetUnfolder]: 280/566 cut-off events. [2022-12-05 23:04:52,040 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-05 23:04:52,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 566 events. 280/566 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3181 event pairs, 139 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 1263. Up to 383 conditions per place. [2022-12-05 23:04:52,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 133 flow [2022-12-05 23:04:52,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-05 23:04:52,063 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:52,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-05 23:04:52,064 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 133 flow [2022-12-05 23:04:52,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:52,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:52,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:52,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:04:52,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 343091386, now seen corresponding path program 1 times [2022-12-05 23:04:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:52,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575610625] [2022-12-05 23:04:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:52,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:52,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575610625] [2022-12-05 23:04:52,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575610625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:52,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:52,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:52,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228079816] [2022-12-05 23:04:52,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:52,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:52,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:52,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:52,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:52,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:52,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:52,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:52,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:52,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:53,022 INFO L130 PetriNetUnfolder]: 4845/7076 cut-off events. [2022-12-05 23:04:53,022 INFO L131 PetriNetUnfolder]: For 2888/2922 co-relation queries the response was YES. [2022-12-05 23:04:53,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18800 conditions, 7076 events. 4845/7076 cut-off events. For 2888/2922 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 38332 event pairs, 1343 based on Foata normal form. 75/7005 useless extension candidates. Maximal degree in co-relation 18787. Up to 5084 conditions per place. [2022-12-05 23:04:53,056 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 49 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-05 23:04:53,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 341 flow [2022-12-05 23:04:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 23:04:53,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:04:53,059 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 133 flow. Second operand 4 states and 55 transitions. [2022-12-05 23:04:53,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 341 flow [2022-12-05 23:04:53,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 341 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:04:53,062 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 192 flow [2022-12-05 23:04:53,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-12-05 23:04:53,063 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2022-12-05 23:04:53,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:53,063 INFO L89 Accepts]: Start accepts. Operand has 45 places, 40 transitions, 192 flow [2022-12-05 23:04:53,064 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:53,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:53,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 192 flow [2022-12-05 23:04:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 192 flow [2022-12-05 23:04:53,108 INFO L130 PetriNetUnfolder]: 338/675 cut-off events. [2022-12-05 23:04:53,109 INFO L131 PetriNetUnfolder]: For 320/327 co-relation queries the response was YES. [2022-12-05 23:04:53,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 675 events. 338/675 cut-off events. For 320/327 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3923 event pairs, 154 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 1687. Up to 439 conditions per place. [2022-12-05 23:04:53,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 192 flow [2022-12-05 23:04:53,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-05 23:04:53,118 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:53,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:04:53,122 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 192 flow [2022-12-05 23:04:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:53,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:53,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:53,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:04:53,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1979594916, now seen corresponding path program 1 times [2022-12-05 23:04:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066473075] [2022-12-05 23:04:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:53,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066473075] [2022-12-05 23:04:53,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066473075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:53,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:53,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:53,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732741342] [2022-12-05 23:04:53,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:53,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:53,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:04:53,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:53,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:53,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:04:53,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:54,218 INFO L130 PetriNetUnfolder]: 5231/7579 cut-off events. [2022-12-05 23:04:54,218 INFO L131 PetriNetUnfolder]: For 5220/5354 co-relation queries the response was YES. [2022-12-05 23:04:54,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22185 conditions, 7579 events. 5231/7579 cut-off events. For 5220/5354 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 41195 event pairs, 1199 based on Foata normal form. 67/7437 useless extension candidates. Maximal degree in co-relation 22168. Up to 4993 conditions per place. [2022-12-05 23:04:54,248 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 53 selfloop transitions, 18 changer transitions 0/77 dead transitions. [2022-12-05 23:04:54,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 468 flow [2022-12-05 23:04:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-05 23:04:54,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.528 [2022-12-05 23:04:54,252 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 192 flow. Second operand 5 states and 66 transitions. [2022-12-05 23:04:54,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 468 flow [2022-12-05 23:04:54,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:04:54,262 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 329 flow [2022-12-05 23:04:54,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2022-12-05 23:04:54,264 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2022-12-05 23:04:54,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:54,264 INFO L89 Accepts]: Start accepts. Operand has 51 places, 52 transitions, 329 flow [2022-12-05 23:04:54,265 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:54,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:54,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 52 transitions, 329 flow [2022-12-05 23:04:54,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 52 transitions, 329 flow [2022-12-05 23:04:54,317 INFO L130 PetriNetUnfolder]: 401/773 cut-off events. [2022-12-05 23:04:54,317 INFO L131 PetriNetUnfolder]: For 964/999 co-relation queries the response was YES. [2022-12-05 23:04:54,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 773 events. 401/773 cut-off events. For 964/999 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4505 event pairs, 135 based on Foata normal form. 13/766 useless extension candidates. Maximal degree in co-relation 2441. Up to 521 conditions per place. [2022-12-05 23:04:54,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 52 transitions, 329 flow [2022-12-05 23:04:54,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-05 23:04:54,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L783-->L786: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [467] L2-1-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_98 256) 0))) (.cse3 (not (= 0 (mod v_~z$r_buff1_thd0~0_102 256))))) (let ((.cse2 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_170 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_188 256) 0)) .cse5))) (and (= v_~z$r_buff0_thd0~0_97 (ite .cse0 0 v_~z$r_buff0_thd0~0_98)) (= (ite .cse1 v_~z$w_buff0~0_106 (ite .cse2 v_~z$w_buff1~0_108 v_~z~0_132)) v_~z~0_131) (= v_~z$w_buff1_used~0_169 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_170)) (= (ite .cse1 0 v_~z$w_buff0_used~0_188) v_~z$w_buff0_used~0_187) (= v_~z$r_buff1_thd0~0_101 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_169 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_97 256) 0)))) 0 v_~z$r_buff1_thd0~0_102))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_98, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_188, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_102, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_170, ~z$w_buff1~0=v_~z$w_buff1~0_108, ~z~0=v_~z~0_132} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_187, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_169, ~z$w_buff1~0=v_~z$w_buff1~0_108, ~z~0=v_~z~0_131} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:04:54,489 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L783-->L786: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~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, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:54,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L783-->L786: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~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, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:04:54,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L783-->L786: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [467] L2-1-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_187 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_98 256) 0))) (.cse3 (not (= 0 (mod v_~z$r_buff1_thd0~0_102 256))))) (let ((.cse2 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_170 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff0_used~0_188 256) 0)) .cse5))) (and (= v_~z$r_buff0_thd0~0_97 (ite .cse0 0 v_~z$r_buff0_thd0~0_98)) (= (ite .cse1 v_~z$w_buff0~0_106 (ite .cse2 v_~z$w_buff1~0_108 v_~z~0_132)) v_~z~0_131) (= v_~z$w_buff1_used~0_169 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_170)) (= (ite .cse1 0 v_~z$w_buff0_used~0_188) v_~z$w_buff0_used~0_187) (= v_~z$r_buff1_thd0~0_101 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_169 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_97 256) 0)))) 0 v_~z$r_buff1_thd0~0_102))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_98, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_188, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_102, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_170, ~z$w_buff1~0=v_~z$w_buff1~0_108, ~z~0=v_~z~0_132} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_97, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_187, ~z$w_buff0~0=v_~z$w_buff0~0_106, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_169, ~z$w_buff1~0=v_~z$w_buff1~0_108, ~z~0=v_~z~0_131} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:04:54,795 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:04:54,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 531 [2022-12-05 23:04:54,795 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 349 flow [2022-12-05 23:04:54,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:54,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:54,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:04:54,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash 618089551, now seen corresponding path program 1 times [2022-12-05 23:04:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:54,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024850314] [2022-12-05 23:04:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:55,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024850314] [2022-12-05 23:04:55,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024850314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:55,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:55,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488297790] [2022-12-05 23:04:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:55,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:55,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:55,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:55,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:55,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:55,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:55,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:55,710 INFO L130 PetriNetUnfolder]: 5169/7483 cut-off events. [2022-12-05 23:04:55,710 INFO L131 PetriNetUnfolder]: For 14321/14436 co-relation queries the response was YES. [2022-12-05 23:04:55,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26309 conditions, 7483 events. 5169/7483 cut-off events. For 14321/14436 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 40406 event pairs, 1199 based on Foata normal form. 54/7346 useless extension candidates. Maximal degree in co-relation 26288. Up to 5005 conditions per place. [2022-12-05 23:04:55,752 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 52 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-05 23:04:55,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 587 flow [2022-12-05 23:04:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-05 23:04:55,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2022-12-05 23:04:55,754 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 349 flow. Second operand 4 states and 58 transitions. [2022-12-05 23:04:55,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 587 flow [2022-12-05 23:04:55,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 532 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-12-05 23:04:55,800 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 386 flow [2022-12-05 23:04:55,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-05 23:04:55,802 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2022-12-05 23:04:55,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:55,802 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 386 flow [2022-12-05 23:04:55,802 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:55,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:55,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 386 flow [2022-12-05 23:04:55,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 386 flow [2022-12-05 23:04:55,859 INFO L130 PetriNetUnfolder]: 423/805 cut-off events. [2022-12-05 23:04:55,859 INFO L131 PetriNetUnfolder]: For 1365/1391 co-relation queries the response was YES. [2022-12-05 23:04:55,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 805 events. 423/805 cut-off events. For 1365/1391 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4678 event pairs, 143 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 2601. Up to 551 conditions per place. [2022-12-05 23:04:55,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 386 flow [2022-12-05 23:04:55,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-05 23:04:55,881 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:55,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 23:04:55,881 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 386 flow [2022-12-05 23:04:55,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:55,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:55,882 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:55,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:04:55,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash 618093612, now seen corresponding path program 1 times [2022-12-05 23:04:55,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:55,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461706349] [2022-12-05 23:04:55,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:55,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:56,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461706349] [2022-12-05 23:04:56,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461706349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:56,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:56,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:56,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834324555] [2022-12-05 23:04:56,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:56,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:56,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:56,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:56,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:56,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:56,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:56,917 INFO L130 PetriNetUnfolder]: 5294/7653 cut-off events. [2022-12-05 23:04:56,918 INFO L131 PetriNetUnfolder]: For 17017/17164 co-relation queries the response was YES. [2022-12-05 23:04:56,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26995 conditions, 7653 events. 5294/7653 cut-off events. For 17017/17164 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 41437 event pairs, 1195 based on Foata normal form. 58/7487 useless extension candidates. Maximal degree in co-relation 26973. Up to 5205 conditions per place. [2022-12-05 23:04:56,948 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 54 selfloop transitions, 23 changer transitions 0/83 dead transitions. [2022-12-05 23:04:56,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 673 flow [2022-12-05 23:04:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-05 23:04:56,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2022-12-05 23:04:56,950 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 386 flow. Second operand 5 states and 66 transitions. [2022-12-05 23:04:56,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 673 flow [2022-12-05 23:04:56,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 83 transitions, 636 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:56,972 INFO L231 Difference]: Finished difference. Result has 54 places, 63 transitions, 495 flow [2022-12-05 23:04:56,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=54, PETRI_TRANSITIONS=63} [2022-12-05 23:04:56,972 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2022-12-05 23:04:56,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:56,972 INFO L89 Accepts]: Start accepts. Operand has 54 places, 63 transitions, 495 flow [2022-12-05 23:04:56,973 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:56,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:56,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 63 transitions, 495 flow [2022-12-05 23:04:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 63 transitions, 495 flow [2022-12-05 23:04:57,026 INFO L130 PetriNetUnfolder]: 437/823 cut-off events. [2022-12-05 23:04:57,026 INFO L131 PetriNetUnfolder]: For 1929/1959 co-relation queries the response was YES. [2022-12-05 23:04:57,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 823 events. 437/823 cut-off events. For 1929/1959 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4769 event pairs, 143 based on Foata normal form. 2/798 useless extension candidates. Maximal degree in co-relation 2901. Up to 569 conditions per place. [2022-12-05 23:04:57,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 63 transitions, 495 flow [2022-12-05 23:04:57,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-05 23:04:57,037 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:57,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-05 23:04:57,038 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 63 transitions, 495 flow [2022-12-05 23:04:57,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:57,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:57,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:57,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:04:57,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 914957045, now seen corresponding path program 1 times [2022-12-05 23:04:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:57,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226744024] [2022-12-05 23:04:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:57,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226744024] [2022-12-05 23:04:57,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226744024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:57,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:57,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892266442] [2022-12-05 23:04:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:57,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:57,374 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:57,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 63 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:57,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:57,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:57,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:58,058 INFO L130 PetriNetUnfolder]: 5677/8253 cut-off events. [2022-12-05 23:04:58,058 INFO L131 PetriNetUnfolder]: For 22278/22416 co-relation queries the response was YES. [2022-12-05 23:04:58,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29916 conditions, 8253 events. 5677/8253 cut-off events. For 22278/22416 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 46189 event pairs, 936 based on Foata normal form. 118/8171 useless extension candidates. Maximal degree in co-relation 29894. Up to 4353 conditions per place. [2022-12-05 23:04:58,096 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 61 selfloop transitions, 31 changer transitions 0/98 dead transitions. [2022-12-05 23:04:58,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 832 flow [2022-12-05 23:04:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:04:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:04:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-05 23:04:58,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2022-12-05 23:04:58,098 INFO L175 Difference]: Start difference. First operand has 54 places, 63 transitions, 495 flow. Second operand 5 states and 73 transitions. [2022-12-05 23:04:58,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 832 flow [2022-12-05 23:04:58,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 816 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-05 23:04:58,125 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 623 flow [2022-12-05 23:04:58,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=623, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2022-12-05 23:04:58,125 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2022-12-05 23:04:58,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:58,126 INFO L89 Accepts]: Start accepts. Operand has 59 places, 67 transitions, 623 flow [2022-12-05 23:04:58,126 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:58,126 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:58,126 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 67 transitions, 623 flow [2022-12-05 23:04:58,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 67 transitions, 623 flow [2022-12-05 23:04:58,181 INFO L130 PetriNetUnfolder]: 437/855 cut-off events. [2022-12-05 23:04:58,182 INFO L131 PetriNetUnfolder]: For 2588/2620 co-relation queries the response was YES. [2022-12-05 23:04:58,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 855 events. 437/855 cut-off events. For 2588/2620 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5253 event pairs, 155 based on Foata normal form. 2/833 useless extension candidates. Maximal degree in co-relation 3284. Up to 579 conditions per place. [2022-12-05 23:04:58,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 67 transitions, 623 flow [2022-12-05 23:04:58,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-05 23:04:58,195 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:58,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-05 23:04:58,197 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 623 flow [2022-12-05 23:04:58,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:58,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:58,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:58,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:04:58,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:58,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1979721520, now seen corresponding path program 1 times [2022-12-05 23:04:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:58,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832445910] [2022-12-05 23:04:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:58,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832445910] [2022-12-05 23:04:58,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832445910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:58,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:58,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:04:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114409026] [2022-12-05 23:04:58,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:58,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:04:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:58,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:04:58,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:04:58,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:58,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 623 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 23:04:58,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:58,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:58,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:04:59,221 INFO L130 PetriNetUnfolder]: 6240/9011 cut-off events. [2022-12-05 23:04:59,221 INFO L131 PetriNetUnfolder]: For 34950/35203 co-relation queries the response was YES. [2022-12-05 23:04:59,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35886 conditions, 9011 events. 6240/9011 cut-off events. For 34950/35203 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 51356 event pairs, 3753 based on Foata normal form. 82/8698 useless extension candidates. Maximal degree in co-relation 35861. Up to 6828 conditions per place. [2022-12-05 23:04:59,267 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 62 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2022-12-05 23:04:59,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 819 flow [2022-12-05 23:04:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:04:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:04:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:04:59,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2022-12-05 23:04:59,268 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 623 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:04:59,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 819 flow [2022-12-05 23:04:59,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 744 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-05 23:04:59,334 INFO L231 Difference]: Finished difference. Result has 60 places, 69 transitions, 609 flow [2022-12-05 23:04:59,334 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=609, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2022-12-05 23:04:59,335 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-12-05 23:04:59,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:04:59,335 INFO L89 Accepts]: Start accepts. Operand has 60 places, 69 transitions, 609 flow [2022-12-05 23:04:59,335 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:04:59,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:04:59,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 69 transitions, 609 flow [2022-12-05 23:04:59,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 69 transitions, 609 flow [2022-12-05 23:04:59,397 INFO L130 PetriNetUnfolder]: 469/931 cut-off events. [2022-12-05 23:04:59,397 INFO L131 PetriNetUnfolder]: For 2546/2578 co-relation queries the response was YES. [2022-12-05 23:04:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 931 events. 469/931 cut-off events. For 2546/2578 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5946 event pairs, 173 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 3241. Up to 627 conditions per place. [2022-12-05 23:04:59,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 69 transitions, 609 flow [2022-12-05 23:04:59,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-05 23:04:59,413 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:04:59,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-05 23:04:59,413 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 609 flow [2022-12-05 23:04:59,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 23:04:59,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:04:59,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:04:59,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:04:59,414 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:04:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:04:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1981029441, now seen corresponding path program 1 times [2022-12-05 23:04:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:04:59,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268101353] [2022-12-05 23:04:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:04:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:04:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:04:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:04:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:04:59,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268101353] [2022-12-05 23:04:59,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268101353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:04:59,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:04:59,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:04:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809726511] [2022-12-05 23:04:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:04:59,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:04:59,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:04:59,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:04:59,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:04:59,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-05 23:04:59,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:04:59,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:04:59,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-05 23:04:59,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:00,504 INFO L130 PetriNetUnfolder]: 5932/8634 cut-off events. [2022-12-05 23:05:00,504 INFO L131 PetriNetUnfolder]: For 27474/27659 co-relation queries the response was YES. [2022-12-05 23:05:00,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31864 conditions, 8634 events. 5932/8634 cut-off events. For 27474/27659 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 49016 event pairs, 1299 based on Foata normal form. 96/8468 useless extension candidates. Maximal degree in co-relation 31839. Up to 3926 conditions per place. [2022-12-05 23:05:00,543 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 62 selfloop transitions, 23 changer transitions 0/91 dead transitions. [2022-12-05 23:05:00,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 857 flow [2022-12-05 23:05:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 23:05:00,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-05 23:05:00,545 INFO L175 Difference]: Start difference. First operand has 60 places, 69 transitions, 609 flow. Second operand 4 states and 60 transitions. [2022-12-05 23:05:00,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 857 flow [2022-12-05 23:05:00,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:05:00,575 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 669 flow [2022-12-05 23:05:00,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=669, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2022-12-05 23:05:00,575 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2022-12-05 23:05:00,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:00,576 INFO L89 Accepts]: Start accepts. Operand has 62 places, 69 transitions, 669 flow [2022-12-05 23:05:00,576 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:00,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:00,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 69 transitions, 669 flow [2022-12-05 23:05:00,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 69 transitions, 669 flow [2022-12-05 23:05:00,632 INFO L130 PetriNetUnfolder]: 453/899 cut-off events. [2022-12-05 23:05:00,632 INFO L131 PetriNetUnfolder]: For 3404/3434 co-relation queries the response was YES. [2022-12-05 23:05:00,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3357 conditions, 899 events. 453/899 cut-off events. For 3404/3434 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 5724 event pairs, 163 based on Foata normal form. 2/878 useless extension candidates. Maximal degree in co-relation 3334. Up to 601 conditions per place. [2022-12-05 23:05:00,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 69 transitions, 669 flow [2022-12-05 23:05:00,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-05 23:05:00,646 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:00,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-05 23:05:00,647 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 669 flow [2022-12-05 23:05:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:00,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:00,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:00,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:05:00,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:00,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1241741215, now seen corresponding path program 1 times [2022-12-05 23:05:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:00,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599905919] [2022-12-05 23:05:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:00,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:00,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599905919] [2022-12-05 23:05:00,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599905919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:00,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:00,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:05:00,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795108084] [2022-12-05 23:05:00,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:00,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:05:00,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:05:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:05:00,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:05:00,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:00,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:00,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:05:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:01,281 INFO L130 PetriNetUnfolder]: 3884/5820 cut-off events. [2022-12-05 23:05:01,281 INFO L131 PetriNetUnfolder]: For 26673/26864 co-relation queries the response was YES. [2022-12-05 23:05:01,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23110 conditions, 5820 events. 3884/5820 cut-off events. For 26673/26864 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 33532 event pairs, 915 based on Foata normal form. 132/5711 useless extension candidates. Maximal degree in co-relation 23084. Up to 4808 conditions per place. [2022-12-05 23:05:01,310 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 95 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2022-12-05 23:05:01,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 108 transitions, 1257 flow [2022-12-05 23:05:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:05:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:05:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-05 23:05:01,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-05 23:05:01,312 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 669 flow. Second operand 3 states and 60 transitions. [2022-12-05 23:05:01,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 108 transitions, 1257 flow [2022-12-05 23:05:01,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 1177 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:05:01,338 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 654 flow [2022-12-05 23:05:01,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=62, PETRI_TRANSITIONS=73} [2022-12-05 23:05:01,339 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2022-12-05 23:05:01,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:01,339 INFO L89 Accepts]: Start accepts. Operand has 62 places, 73 transitions, 654 flow [2022-12-05 23:05:01,339 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:01,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:01,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 73 transitions, 654 flow [2022-12-05 23:05:01,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 73 transitions, 654 flow [2022-12-05 23:05:01,506 INFO L130 PetriNetUnfolder]: 1162/2090 cut-off events. [2022-12-05 23:05:01,506 INFO L131 PetriNetUnfolder]: For 3320/3369 co-relation queries the response was YES. [2022-12-05 23:05:01,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 2090 events. 1162/2090 cut-off events. For 3320/3369 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 14930 event pairs, 483 based on Foata normal form. 3/1861 useless extension candidates. Maximal degree in co-relation 6557. Up to 975 conditions per place. [2022-12-05 23:05:01,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 73 transitions, 654 flow [2022-12-05 23:05:01,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-05 23:05:01,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:01,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-05 23:05:01,539 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 654 flow [2022-12-05 23:05:01,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:01,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:01,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:01,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:05:01,540 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:01,540 INFO L85 PathProgramCache]: Analyzing trace with hash -534760208, now seen corresponding path program 1 times [2022-12-05 23:05:01,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:01,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576458279] [2022-12-05 23:05:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:01,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576458279] [2022-12-05 23:05:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576458279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:01,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:01,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722036929] [2022-12-05 23:05:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:01,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:01,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:01,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:01,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 23:05:01,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 73 transitions, 654 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:01,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:01,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 23:05:01,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:02,013 INFO L130 PetriNetUnfolder]: 2088/3325 cut-off events. [2022-12-05 23:05:02,013 INFO L131 PetriNetUnfolder]: For 11933/12099 co-relation queries the response was YES. [2022-12-05 23:05:02,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14001 conditions, 3325 events. 2088/3325 cut-off events. For 11933/12099 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18666 event pairs, 367 based on Foata normal form. 301/3503 useless extension candidates. Maximal degree in co-relation 13974. Up to 1696 conditions per place. [2022-12-05 23:05:02,032 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 122 selfloop transitions, 9 changer transitions 0/139 dead transitions. [2022-12-05 23:05:02,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 139 transitions, 1548 flow [2022-12-05 23:05:02,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-05 23:05:02,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2022-12-05 23:05:02,034 INFO L175 Difference]: Start difference. First operand has 62 places, 73 transitions, 654 flow. Second operand 4 states and 82 transitions. [2022-12-05 23:05:02,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 139 transitions, 1548 flow [2022-12-05 23:05:02,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 139 transitions, 1539 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:05:02,044 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 623 flow [2022-12-05 23:05:02,045 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=623, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2022-12-05 23:05:02,045 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2022-12-05 23:05:02,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:02,045 INFO L89 Accepts]: Start accepts. Operand has 65 places, 71 transitions, 623 flow [2022-12-05 23:05:02,054 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:02,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:02,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 71 transitions, 623 flow [2022-12-05 23:05:02,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 71 transitions, 623 flow [2022-12-05 23:05:02,141 INFO L130 PetriNetUnfolder]: 557/1132 cut-off events. [2022-12-05 23:05:02,142 INFO L131 PetriNetUnfolder]: For 2170/2635 co-relation queries the response was YES. [2022-12-05 23:05:02,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4165 conditions, 1132 events. 557/1132 cut-off events. For 2170/2635 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 7632 event pairs, 153 based on Foata normal form. 43/1095 useless extension candidates. Maximal degree in co-relation 4139. Up to 565 conditions per place. [2022-12-05 23:05:02,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 71 transitions, 623 flow [2022-12-05 23:05:02,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 882 [2022-12-05 23:05:02,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L853-3-->L2-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_87 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [511] L783-->L864: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_364 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_215 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_220 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff1_used~0_325 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_365 256) 0)))) (.cse1 (and .cse5 .cse3))) (and (= v_~z$w_buff1_used~0_324 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_325)) (= (ite .cse2 v_~z$w_buff0~0_240 (ite .cse0 v_~z$w_buff1~0_223 1)) v_~z~0_279) (= v_~z$r_buff1_thd0~0_219 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_214 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_324 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_220)) (= (ite .cse2 0 v_~z$w_buff0_used~0_365) v_~z$w_buff0_used~0_364) (= v_~z$r_buff0_thd0~0_214 (ite .cse1 0 v_~z$r_buff0_thd0~0_215))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_215, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_365, ~z$w_buff0~0=v_~z$w_buff0~0_240, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_220, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_325, ~z$w_buff1~0=v_~z$w_buff1~0_223} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_364, ~z$w_buff0~0=v_~z$w_buff0~0_240, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_324, ~z$w_buff1~0=v_~z$w_buff1~0_223, ~z~0=v_~z~0_279} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:05:02,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L853-3-->L2-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= (mod v_~main$tmp_guard0~0_34 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_19| 0)) (= v_~main$tmp_guard0~0_34 (ite (= (ite (= v_~__unbuffered_cnt~0_87 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_23|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_34, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [506] L783-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_344 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_207 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_212 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_309 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_345 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_309) v_~z$w_buff1_used~0_308) (= (ite .cse2 v_~z$w_buff0~0_226 (ite .cse1 v_~z$w_buff1~0_213 1)) v_~z~0_263) (= (ite .cse2 0 v_~z$w_buff0_used~0_345) v_~z$w_buff0_used~0_344) (= v_~z$r_buff0_thd0~0_206 (ite .cse0 0 v_~z$r_buff0_thd0~0_207)) (= v_~z$r_buff1_thd0~0_211 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_308 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd0~0_206 256) 0)))) 0 v_~z$r_buff1_thd0~0_212))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_207, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_345, ~z$w_buff0~0=v_~z$w_buff0~0_226, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_212, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_309, ~z$w_buff1~0=v_~z$w_buff1~0_213} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_206, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_344, ~z$w_buff0~0=v_~z$w_buff0~0_226, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_211, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ~z$w_buff1~0=v_~z$w_buff1~0_213, ~z~0=v_~z~0_263} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-05 23:05:02,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:05:02,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 497 [2022-12-05 23:05:02,542 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 639 flow [2022-12-05 23:05:02,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:02,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:02,542 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 23:05:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:05:02,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:02,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1545166947, now seen corresponding path program 1 times [2022-12-05 23:05:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:02,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298626376] [2022-12-05 23:05:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:02,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298626376] [2022-12-05 23:05:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298626376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:02,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:05:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657031476] [2022-12-05 23:05:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:02,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:05:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:02,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:05:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:05:02,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 23:05:02,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 639 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:02,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:02,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 23:05:02,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:03,235 INFO L130 PetriNetUnfolder]: 3693/5608 cut-off events. [2022-12-05 23:05:03,235 INFO L131 PetriNetUnfolder]: For 16113/16113 co-relation queries the response was YES. [2022-12-05 23:05:03,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24261 conditions, 5608 events. 3693/5608 cut-off events. For 16113/16113 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29753 event pairs, 554 based on Foata normal form. 37/5645 useless extension candidates. Maximal degree in co-relation 24232. Up to 2921 conditions per place. [2022-12-05 23:05:03,258 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 85 selfloop transitions, 9 changer transitions 32/126 dead transitions. [2022-12-05 23:05:03,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 126 transitions, 1306 flow [2022-12-05 23:05:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:05:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:05:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-05 23:05:03,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-05 23:05:03,272 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 639 flow. Second operand 4 states and 68 transitions. [2022-12-05 23:05:03,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 126 transitions, 1306 flow [2022-12-05 23:05:03,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 126 transitions, 1272 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-05 23:05:03,286 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 529 flow [2022-12-05 23:05:03,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=529, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-12-05 23:05:03,287 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2022-12-05 23:05:03,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:03,287 INFO L89 Accepts]: Start accepts. Operand has 68 places, 64 transitions, 529 flow [2022-12-05 23:05:03,288 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:03,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:03,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 64 transitions, 529 flow [2022-12-05 23:05:03,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 64 transitions, 529 flow [2022-12-05 23:05:03,375 INFO L130 PetriNetUnfolder]: 692/1443 cut-off events. [2022-12-05 23:05:03,375 INFO L131 PetriNetUnfolder]: For 2892/3267 co-relation queries the response was YES. [2022-12-05 23:05:03,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4976 conditions, 1443 events. 692/1443 cut-off events. For 2892/3267 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 10601 event pairs, 128 based on Foata normal form. 58/1408 useless extension candidates. Maximal degree in co-relation 4948. Up to 660 conditions per place. [2022-12-05 23:05:03,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 64 transitions, 529 flow [2022-12-05 23:05:03,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-05 23:05:03,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L853-3-->L864: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_376 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_232 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_227 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff0_used~0_377 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_337 256) 0)) .cse0)) (.cse2 (and .cse5 .cse1))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_336 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_226 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_232) v_~z$r_buff1_thd0~0_231) (= v_~z$r_buff0_thd0~0_226 (ite .cse2 0 v_~z$r_buff0_thd0~0_227)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_82) (= v_~z$w_buff0_used~0_376 (ite .cse3 0 v_~z$w_buff0_used~0_377)) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z~0_291 (ite .cse3 v_~z$w_buff0~0_248 (ite .cse4 v_~z$w_buff1~0_231 1))) (= v_~z$w_buff1_used~0_336 (ite (or .cse4 .cse2) 0 v_~z$w_buff1_used~0_337))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_227, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_377, ~z$w_buff0~0=v_~z$w_buff0~0_248, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_232, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_337, ~z$w_buff1~0=v_~z$w_buff1~0_231, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_71|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_376, ~z$w_buff0~0=v_~z$w_buff0~0_248, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_336, ~z$w_buff1~0=v_~z$w_buff1~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_226, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_231, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~z~0=v_~z~0_291, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~main$tmp_guard0~0, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~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, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:05:03,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] L853-3-->L864: Formula: (let ((.cse1 (not (= (mod v_~z$w_buff0_used~0_376 256) 0))) (.cse0 (not (= (mod v_~z$r_buff1_thd0~0_232 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_227 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff0_used~0_377 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_337 256) 0)) .cse0)) (.cse2 (and .cse5 .cse1))) (and (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_336 256) 0)) .cse0) (and (not (= (mod v_~z$r_buff0_thd0~0_226 256) 0)) .cse1)) 0 v_~z$r_buff1_thd0~0_232) v_~z$r_buff1_thd0~0_231) (= v_~z$r_buff0_thd0~0_226 (ite .cse2 0 v_~z$r_buff0_thd0~0_227)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_261 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_82) (= v_~z$w_buff0_used~0_376 (ite .cse3 0 v_~z$w_buff0_used~0_377)) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|) (= v_~z~0_291 (ite .cse3 v_~z$w_buff0~0_248 (ite .cse4 v_~z$w_buff1~0_231 1))) (= v_~z$w_buff1_used~0_336 (ite (or .cse4 .cse2) 0 v_~z$w_buff1_used~0_337))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_227, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_377, ~z$w_buff0~0=v_~z$w_buff0~0_248, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_232, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_337, ~z$w_buff1~0=v_~z$w_buff1~0_231, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_71|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_376, ~z$w_buff0~0=v_~z$w_buff0~0_248, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_336, ~z$w_buff1~0=v_~z$w_buff1~0_231, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_226, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_231, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_261, ~z~0=v_~z~0_291, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_61|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~main$tmp_guard0~0, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [373] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_83 256) 0)) .cse3)) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_94 256) 0)) .cse5))) (and (= v_~z~0_47 (ite .cse0 v_~z$w_buff0~0_42 (ite .cse1 v_~z$w_buff1~0_45 v_~z~0_48))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_82 256) 0)) .cse3)) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21) (= (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82) (= v_~z$r_buff0_thd3~0_23 (ite .cse4 0 v_~z$r_buff0_thd3~0_24)) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_48} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_42, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_45, ~z~0=v_~z~0_47} 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 23:05:03,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L853-3-->L793: Formula: (let ((.cse14 (not (= (mod v_~z$r_buff0_thd0~0_243 256) 0)))) (let ((.cse2 (and .cse14 (not (= (mod v_~z$w_buff0_used~0_396 256) 0))))) (let ((.cse11 (ite .cse2 0 v_~z$w_buff0_used~0_396))) (let ((.cse4 (not (= (mod .cse11 256) 0))) (.cse5 (not (= (mod v_~z$r_buff1_thd0~0_250 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~z$w_buff1_used~0_356 256) 0)))) (.cse12 (and .cse4 .cse14))) (let ((.cse8 (ite (or .cse3 .cse12) 0 v_~z$w_buff1_used~0_356))) (let ((.cse13 (not (= (mod v_~z$r_buff0_thd3~0_124 256) 0))) (.cse10 (not (= (mod v_~z$w_buff0_used~0_394 256) 0))) (.cse6 (not (= (mod .cse8 256) 0))) (.cse9 (not (= (mod v_~z$r_buff1_thd3~0_122 256) 0)))) (let ((.cse1 (and .cse6 .cse9)) (.cse7 (and .cse13 .cse10)) (.cse0 (and .cse13 .cse4))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_90 256)) (= v_~z~0_301 (ite .cse0 v_~z$w_buff0~0_258 (ite .cse1 v_~z$w_buff1~0_241 (ite .cse2 v_~z$w_buff0~0_258 (ite .cse3 v_~z$w_buff1~0_241 1))))) (= v_~z$r_buff1_thd0~0_249 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_242 256) 0)) .cse4) (and .cse5 .cse6)) 0 v_~z$r_buff1_thd0~0_250)) (= (ite (or .cse1 .cse7) 0 .cse8) v_~z$w_buff1_used~0_354) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_67| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite (or (and .cse9 (not (= (mod v_~z$w_buff1_used~0_354 256) 0))) (and (not (= (mod v_~z$r_buff0_thd3~0_123 256) 0)) .cse10)) 0 v_~z$r_buff1_thd3~0_122) v_~z$r_buff1_thd3~0_121) (= (ite .cse7 0 v_~z$r_buff0_thd3~0_124) v_~z$r_buff0_thd3~0_123) (= v_~z$w_buff0_used~0_394 (ite .cse0 0 .cse11)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_269 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_90) (= v_~z$r_buff0_thd0~0_242 (ite .cse12 0 v_~z$r_buff0_thd0~0_243))))))))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_243, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_396, ~z$w_buff0~0=v_~z$w_buff0~0_258, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_122, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_250, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_356, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_124, ~z$w_buff1~0=v_~z$w_buff1~0_241, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_269} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_79|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_394, ~z$w_buff0~0=v_~z$w_buff0~0_258, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_89|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_354, ~z$w_buff1~0=v_~z$w_buff1~0_241, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_90, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_242, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_249, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_67|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_269, ~z~0=v_~z~0_301, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~main$tmp_guard0~0, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [505] $Ultimate##0-->L819: Formula: (and (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_266 256) 0)) (not (= (mod v_~z$w_buff0_used~0_295 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|) (= v_~z$r_buff0_thd3~0_85 v_~z$r_buff1_thd3~0_81) (= v_~z$w_buff0_used~0_295 1) (= v_~z$r_buff1_thd4~0_91 v_~z$r_buff0_thd4~0_113) (= |v_P3Thread1of1ForFork2_~arg#1.offset_19| |v_P3Thread1of1ForFork2_#in~arg#1.offset_19|) (= v_~a~0_40 1) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23| |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|) (= v_~z$r_buff0_thd4~0_112 1) (= v_~a~0_40 v_~__unbuffered_p3_EAX~0_70) (= v_~z$w_buff0~0_192 2) (= v_~z$r_buff0_thd2~0_43 v_~z$r_buff1_thd2~0_43) (= |v_P3Thread1of1ForFork2_~arg#1.base_19| |v_P3Thread1of1ForFork2_#in~arg#1.base_19|) (= v_~z$r_buff0_thd0~0_177 v_~z$r_buff1_thd0~0_182) (= v_~z$w_buff0_used~0_296 v_~z$w_buff1_used~0_266) (not (= |v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23| 0)) (= v_~z$w_buff0~0_193 v_~z$w_buff1~0_185) (= v_~z$r_buff0_thd1~0_39 v_~z$r_buff1_thd1~0_45)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_296, ~z$w_buff0~0=v_~z$w_buff0~0_193, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_91, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_295, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_81, P3Thread1of1ForFork2_#in~arg#1.offset=|v_P3Thread1of1ForFork2_#in~arg#1.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_266, ~z$w_buff1~0=v_~z$w_buff1~0_185, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_23|, ~a~0=v_~a~0_40, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P3Thread1of1ForFork2___VERIFIER_assert_~expression#1_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_177, P3Thread1of1ForFork2_~arg#1.offset=|v_P3Thread1of1ForFork2_~arg#1.offset_19|, P3Thread1of1ForFork2_~arg#1.base=|v_P3Thread1of1ForFork2_~arg#1.base_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_45, P3Thread1of1ForFork2_#in~arg#1.base=|v_P3Thread1of1ForFork2_#in~arg#1.base_19|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_112, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_43} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~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, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~a~0, P3Thread1of1ForFork2___VERIFIER_assert_~expression#1, P3Thread1of1ForFork2_~arg#1.offset, P3Thread1of1ForFork2_~arg#1.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] [2022-12-05 23:05:04,177 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:05:04,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 890 [2022-12-05 23:05:04,177 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 541 flow [2022-12-05 23:05:04,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:04,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:04,178 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 23:05:04,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:05:04,178 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -93694139, now seen corresponding path program 1 times [2022-12-05 23:05:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:04,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508235293] [2022-12-05 23:05:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:04,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508235293] [2022-12-05 23:05:04,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508235293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:04,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:04,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:05:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737275923] [2022-12-05 23:05:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:04,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:04,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:04,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 23:05:04,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 541 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:04,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:04,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 23:05:04,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:04,629 INFO L130 PetriNetUnfolder]: 1639/2762 cut-off events. [2022-12-05 23:05:04,630 INFO L131 PetriNetUnfolder]: For 10926/11238 co-relation queries the response was YES. [2022-12-05 23:05:04,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11780 conditions, 2762 events. 1639/2762 cut-off events. For 10926/11238 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16578 event pairs, 212 based on Foata normal form. 378/3063 useless extension candidates. Maximal degree in co-relation 11749. Up to 954 conditions per place. [2022-12-05 23:05:04,676 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 95 selfloop transitions, 13 changer transitions 4/122 dead transitions. [2022-12-05 23:05:04,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 122 transitions, 1237 flow [2022-12-05 23:05:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:05:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:05:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-05 23:05:04,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-05 23:05:04,678 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 541 flow. Second operand 5 states and 93 transitions. [2022-12-05 23:05:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 122 transitions, 1237 flow [2022-12-05 23:05:04,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 1151 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-05 23:05:04,687 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 459 flow [2022-12-05 23:05:04,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2022-12-05 23:05:04,688 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2022-12-05 23:05:04,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:04,688 INFO L89 Accepts]: Start accepts. Operand has 66 places, 59 transitions, 459 flow [2022-12-05 23:05:04,689 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:04,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:04,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 59 transitions, 459 flow [2022-12-05 23:05:04,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 59 transitions, 459 flow [2022-12-05 23:05:04,762 INFO L130 PetriNetUnfolder]: 370/835 cut-off events. [2022-12-05 23:05:04,763 INFO L131 PetriNetUnfolder]: For 1842/2235 co-relation queries the response was YES. [2022-12-05 23:05:04,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 835 events. 370/835 cut-off events. For 1842/2235 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5576 event pairs, 35 based on Foata normal form. 70/854 useless extension candidates. Maximal degree in co-relation 3208. Up to 382 conditions per place. [2022-12-05 23:05:04,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 59 transitions, 459 flow [2022-12-05 23:05:04,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 700 [2022-12-05 23:05:04,782 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:04,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-05 23:05:04,796 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 459 flow [2022-12-05 23:05:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:04,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:04,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:04,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:05:04,797 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:04,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1402975428, now seen corresponding path program 1 times [2022-12-05 23:05:04,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:04,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382504458] [2022-12-05 23:05:04,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:04,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382504458] [2022-12-05 23:05:05,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382504458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:05,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:05,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:05:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052141636] [2022-12-05 23:05:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:05,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:05:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:05:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:05:05,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-05 23:05:05,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 459 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:05,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:05,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-05 23:05:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:05,651 INFO L130 PetriNetUnfolder]: 3264/5161 cut-off events. [2022-12-05 23:05:05,651 INFO L131 PetriNetUnfolder]: For 15675/15675 co-relation queries the response was YES. [2022-12-05 23:05:05,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23044 conditions, 5161 events. 3264/5161 cut-off events. For 15675/15675 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 29868 event pairs, 180 based on Foata normal form. 10/5171 useless extension candidates. Maximal degree in co-relation 23014. Up to 2266 conditions per place. [2022-12-05 23:05:05,666 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 89 selfloop transitions, 16 changer transitions 80/185 dead transitions. [2022-12-05 23:05:05,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 185 transitions, 1762 flow [2022-12-05 23:05:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:05:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:05:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-05 23:05:05,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-05 23:05:05,668 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 459 flow. Second operand 6 states and 98 transitions. [2022-12-05 23:05:05,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 185 transitions, 1762 flow [2022-12-05 23:05:05,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 185 transitions, 1616 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-12-05 23:05:05,705 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 492 flow [2022-12-05 23:05:05,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2022-12-05 23:05:05,705 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-12-05 23:05:05,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:05,706 INFO L89 Accepts]: Start accepts. Operand has 70 places, 62 transitions, 492 flow [2022-12-05 23:05:05,706 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:05,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:05,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 62 transitions, 492 flow [2022-12-05 23:05:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 62 transitions, 492 flow [2022-12-05 23:05:05,756 INFO L130 PetriNetUnfolder]: 350/875 cut-off events. [2022-12-05 23:05:05,756 INFO L131 PetriNetUnfolder]: For 1762/1968 co-relation queries the response was YES. [2022-12-05 23:05:05,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 875 events. 350/875 cut-off events. For 1762/1968 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6241 event pairs, 48 based on Foata normal form. 83/912 useless extension candidates. Maximal degree in co-relation 3038. Up to 313 conditions per place. [2022-12-05 23:05:05,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 62 transitions, 492 flow [2022-12-05 23:05:05,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-05 23:05:05,764 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:05:05,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-05 23:05:05,765 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 492 flow [2022-12-05 23:05:05,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:05,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:05:05,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:05:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:05:05,765 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:05:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:05:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1656616626, now seen corresponding path program 2 times [2022-12-05 23:05:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:05:05,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999449242] [2022-12-05 23:05:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:05:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:05:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:05:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:05:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:05:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999449242] [2022-12-05 23:05:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999449242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:05:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:05:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:05:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295647358] [2022-12-05 23:05:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:05:05,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:05:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:05:05,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:05:05,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:05:05,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-05 23:05:05,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:05:05,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:05:05,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-05 23:05:05,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:05:06,130 INFO L130 PetriNetUnfolder]: 1297/2223 cut-off events. [2022-12-05 23:05:06,130 INFO L131 PetriNetUnfolder]: For 7706/8075 co-relation queries the response was YES. [2022-12-05 23:05:06,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9619 conditions, 2223 events. 1297/2223 cut-off events. For 7706/8075 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13344 event pairs, 189 based on Foata normal form. 243/2404 useless extension candidates. Maximal degree in co-relation 9589. Up to 799 conditions per place. [2022-12-05 23:05:06,138 INFO L137 encePairwiseOnDemand]: 21/27 looper letters, 82 selfloop transitions, 17 changer transitions 15/123 dead transitions. [2022-12-05 23:05:06,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 1234 flow [2022-12-05 23:05:06,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:05:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:05:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2022-12-05 23:05:06,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5679012345679012 [2022-12-05 23:05:06,140 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 492 flow. Second operand 6 states and 92 transitions. [2022-12-05 23:05:06,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 1234 flow [2022-12-05 23:05:06,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 1168 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-05 23:05:06,166 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 468 flow [2022-12-05 23:05:06,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2022-12-05 23:05:06,168 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-05 23:05:06,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:05:06,168 INFO L89 Accepts]: Start accepts. Operand has 72 places, 58 transitions, 468 flow [2022-12-05 23:05:06,170 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:05:06,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:05:06,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 58 transitions, 468 flow [2022-12-05 23:05:06,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 58 transitions, 468 flow [2022-12-05 23:05:06,190 INFO L130 PetriNetUnfolder]: 136/332 cut-off events. [2022-12-05 23:05:06,190 INFO L131 PetriNetUnfolder]: For 758/796 co-relation queries the response was YES. [2022-12-05 23:05:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 332 events. 136/332 cut-off events. For 758/796 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1777 event pairs, 8 based on Foata normal form. 1/318 useless extension candidates. Maximal degree in co-relation 1290. Up to 104 conditions per place. [2022-12-05 23:05:06,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 58 transitions, 468 flow [2022-12-05 23:05:06,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-05 23:05:06,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L783: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_19 2) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_19, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [366] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-05 23:06:39,341 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:06:39,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93174 [2022-12-05 23:06:39,342 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 467 flow [2022-12-05 23:06:39,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:39,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:06:39,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:06:39,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 23:06:39,342 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 23:06:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:06:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -696000418, now seen corresponding path program 1 times [2022-12-05 23:06:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:06:39,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936191530] [2022-12-05 23:06:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:06:39,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:06:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:06:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:06:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:06:39,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936191530] [2022-12-05 23:06:39,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936191530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:06:39,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:06:39,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:06:39,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332756547] [2022-12-05 23:06:39,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:06:39,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:06:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:06:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:06:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:06:39,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 23:06:39,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:06:39,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:06:39,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 23:06:39,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:06:39,571 INFO L130 PetriNetUnfolder]: 680/1169 cut-off events. [2022-12-05 23:06:39,571 INFO L131 PetriNetUnfolder]: For 4355/4367 co-relation queries the response was YES. [2022-12-05 23:06:39,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 1169 events. 680/1169 cut-off events. For 4355/4367 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5552 event pairs, 172 based on Foata normal form. 3/1164 useless extension candidates. Maximal degree in co-relation 5391. Up to 539 conditions per place. [2022-12-05 23:06:39,576 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 32 selfloop transitions, 1 changer transitions 66/102 dead transitions. [2022-12-05 23:06:39,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 1012 flow [2022-12-05 23:06:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:06:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:06:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-05 23:06:39,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-05 23:06:39,577 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 467 flow. Second operand 4 states and 59 transitions. [2022-12-05 23:06:39,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 1012 flow [2022-12-05 23:06:39,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 890 flow, removed 30 selfloop flow, removed 5 redundant places. [2022-12-05 23:06:39,586 INFO L231 Difference]: Finished difference. Result has 70 places, 35 transitions, 218 flow [2022-12-05 23:06:39,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=70, PETRI_TRANSITIONS=35} [2022-12-05 23:06:39,587 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 27 predicate places. [2022-12-05 23:06:39,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:06:39,587 INFO L89 Accepts]: Start accepts. Operand has 70 places, 35 transitions, 218 flow [2022-12-05 23:06:39,605 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:06:39,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:06:39,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 35 transitions, 218 flow [2022-12-05 23:06:39,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 35 transitions, 218 flow [2022-12-05 23:06:39,612 INFO L130 PetriNetUnfolder]: 23/79 cut-off events. [2022-12-05 23:06:39,612 INFO L131 PetriNetUnfolder]: For 233/264 co-relation queries the response was YES. [2022-12-05 23:06:39,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 79 events. 23/79 cut-off events. For 233/264 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 0 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 245. Up to 22 conditions per place. [2022-12-05 23:06:39,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 35 transitions, 218 flow [2022-12-05 23:06:39,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-05 23:06:39,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [383] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0] and [366] L768-->L771: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-05 23:06:39,670 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:06:39,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] $Ultimate##0-->L768: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_~x~0_14 1) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [522] L822-->L771: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd4~0_109 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_147 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_416 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_417 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_377 256) 0)) .cse4))) (and (= v_~z$w_buff1_used~0_376 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_377)) (= (ite .cse2 0 v_~z$w_buff0_used~0_417) v_~z$w_buff0_used~0_416) (= (ite .cse0 0 v_~z$r_buff0_thd4~0_147) v_~z$r_buff0_thd4~0_146) (= v_~z~0_317 (ite .cse2 v_~z$w_buff0~0_272 (ite .cse1 v_~z$w_buff1~0_255 v_~z~0_318))) (= v_~y~0_92 1) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_146 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_376 256) 0)) .cse4)) 0 v_~z$r_buff1_thd4~0_109) v_~z$r_buff1_thd4~0_108)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_417, ~z$w_buff0~0=v_~z$w_buff0~0_272, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_147, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_377, ~z$w_buff1~0=v_~z$w_buff1~0_255, ~z~0=v_~z~0_318} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_108, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_416, ~z$w_buff0~0=v_~z$w_buff0~0_272, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_146, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_376, ~z$w_buff1~0=v_~z$w_buff1~0_255, ~z~0=v_~z~0_317, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0, ~y~0] [2022-12-05 23:06:40,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->L771: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_428 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_155 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd4~0_115 256) 0)))) (let ((.cse0 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_387 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_429 256) 0)) .cse5)) (.cse1 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_387) v_~z$w_buff1_used~0_386) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~x~0_42 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_15) (= v_~z~0_327 (ite .cse2 v_~z$w_buff0~0_280 (ite .cse0 v_~z$w_buff1~0_261 v_~z~0_328))) (= v_~y~0_98 1) (= v_~z$w_buff0_used~0_428 (ite .cse2 0 v_~z$w_buff0_used~0_429)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd4~0_154 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_386 256) 0)))) 0 v_~z$r_buff1_thd4~0_115) v_~z$r_buff1_thd4~0_114) (= (ite .cse1 0 v_~z$r_buff0_thd4~0_155) v_~z$r_buff0_thd4~0_154)))) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_115, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_429, ~z$w_buff0~0=v_~z$w_buff0~0_280, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_155, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_387, ~z$w_buff1~0=v_~z$w_buff1~0_261, ~z~0=v_~z~0_328, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_114, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_428, ~z$w_buff0~0=v_~z$w_buff0~0_280, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$w_buff1~0=v_~z$w_buff1~0_261, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_154, ~z~0=v_~z~0_327, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_98, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z~0, ~y~0, ~x~0] and [435] L829-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_7|) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59) (= |v_P3Thread1of1ForFork2_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_7|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-05 23:06:40,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L756: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_81) (= v_~b~0_50 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_81, ~b~0=v_~b~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [529] $Ultimate##0-->L771: Formula: (and (= v_~y~0_100 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= v_~x~0_44 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_100, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~y~0, ~x~0] [2022-12-05 23:06:40,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [526] $Ultimate##0-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_25| 0) (= v_~x~0_40 v_~__unbuffered_p0_EAX~0_83) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17) (= v_~b~0_52 1) (= |v_P0Thread1of1ForFork1_#res.offset_25| 0) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_275 (+ v_~__unbuffered_cnt~0_276 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_276, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_40} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_83, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_25|, ~b~0=v_~b~0_52, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_25|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_275, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] and [529] $Ultimate##0-->L771: Formula: (and (= v_~y~0_100 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= v_~x~0_44 1) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_100, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~y~0, ~x~0] [2022-12-05 23:06:40,565 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-05 23:06:40,565 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:06:40,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 23:06:40,566 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 23:06:40,568 INFO L158 Benchmark]: Toolchain (without parser) took 117247.08ms. Allocated memory was 199.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 174.3MB in the beginning and 925.6MB in the end (delta: -751.2MB). Peak memory consumption was 876.7MB. Max. memory is 8.0GB. [2022-12-05 23:06:40,569 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:06:40,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.23ms. Allocated memory is still 199.2MB. Free memory was 173.9MB in the beginning and 146.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 23:06:40,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.35ms. Allocated memory is still 199.2MB. Free memory was 146.1MB in the beginning and 143.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:40,569 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 199.2MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:06:40,569 INFO L158 Benchmark]: RCFGBuilder took 584.56ms. Allocated memory is still 199.2MB. Free memory was 141.3MB in the beginning and 107.3MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 23:06:40,569 INFO L158 Benchmark]: TraceAbstraction took 116126.89ms. Allocated memory was 199.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 106.2MB in the beginning and 925.6MB in the end (delta: -819.3MB). Peak memory consumption was 808.6MB. Max. memory is 8.0GB. [2022-12-05 23:06:40,570 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 199.2MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.23ms. Allocated memory is still 199.2MB. Free memory was 173.9MB in the beginning and 146.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.35ms. Allocated memory is still 199.2MB. Free memory was 146.1MB in the beginning and 143.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 199.2MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 584.56ms. Allocated memory is still 199.2MB. Free memory was 141.3MB in the beginning and 107.3MB in the end (delta: 34.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 116126.89ms. Allocated memory was 199.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 106.2MB in the beginning and 925.6MB in the end (delta: -819.3MB). Peak memory consumption was 808.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 137 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 31 TransitionsAfterwards, 2936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 2132, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2195, independent: 2132, independent conditional: 0, independent unconditional: 2132, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1774, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1774, independent: 1722, independent conditional: 0, independent unconditional: 1722, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 151, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2195, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 1774, unknown conditional: 0, unknown unconditional: 1774] , Statistics on independence cache: Total cache size (in pairs): 2775, Positive cache size: 2735, Positive conditional cache size: 0, Positive unconditional cache size: 2735, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 328, independent conditional: 328, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 328, independent conditional: 30, independent unconditional: 298, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 377, independent: 328, independent conditional: 30, independent unconditional: 298, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 377, independent: 328, independent conditional: 30, independent unconditional: 298, dependent: 49, dependent conditional: 5, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 184, independent: 164, independent conditional: 20, independent unconditional: 144, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 184, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 55, dependent conditional: 11, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 377, independent: 164, independent conditional: 10, independent unconditional: 154, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 184, unknown conditional: 23, unknown unconditional: 161] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 164, Positive conditional cache size: 20, Positive unconditional cache size: 144, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, 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, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 166, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 166, independent: 144, independent conditional: 6, independent unconditional: 138, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 166, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 172, Positive conditional cache size: 20, Positive unconditional cache size: 152, Negative cache size: 22, Negative conditional cache size: 3, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 20, independent unconditional: 68, dependent: 14, dependent conditional: 2, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 88, independent conditional: 6, independent unconditional: 82, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 6, independent unconditional: 82, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 85, independent conditional: 6, independent unconditional: 79, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 175, Positive conditional cache size: 20, Positive unconditional cache size: 155, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 115, independent conditional: 37, independent unconditional: 78, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 115, independent conditional: 13, independent unconditional: 102, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 115, independent conditional: 13, independent unconditional: 102, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 125, independent: 108, independent conditional: 11, independent unconditional: 97, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 182, Positive conditional cache size: 22, Positive unconditional cache size: 160, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 514, independent: 474, independent conditional: 474, 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: 514, independent: 474, independent conditional: 196, independent unconditional: 278, 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: 514, independent: 474, independent conditional: 78, independent unconditional: 396, 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: 514, independent: 474, independent conditional: 78, independent unconditional: 396, 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: 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: 514, independent: 472, independent conditional: 78, independent unconditional: 394, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 258, Positive conditional cache size: 22, Positive unconditional cache size: 236, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 118, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 263, independent: 238, independent conditional: 238, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 263, independent: 238, independent conditional: 63, independent unconditional: 175, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 263, independent: 238, independent conditional: 23, independent unconditional: 215, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 238, independent conditional: 23, independent unconditional: 215, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 263, independent: 236, independent conditional: 23, independent unconditional: 213, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 260, Positive conditional cache size: 22, Positive unconditional cache size: 238, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 330, independent: 299, independent conditional: 299, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 330, independent: 299, independent conditional: 79, independent unconditional: 220, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 330, independent: 299, independent conditional: 23, independent unconditional: 276, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 330, independent: 299, independent conditional: 23, independent unconditional: 276, dependent: 31, dependent conditional: 0, dependent unconditional: 31, 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: 330, independent: 297, independent conditional: 23, independent unconditional: 274, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 262, Positive conditional cache size: 22, Positive unconditional cache size: 240, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 396, independent: 362, independent conditional: 362, 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: 396, independent: 362, independent conditional: 112, independent unconditional: 250, 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: 396, independent: 362, independent conditional: 46, independent unconditional: 316, 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: 396, independent: 362, independent conditional: 46, independent unconditional: 316, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 396, independent: 362, independent conditional: 46, independent unconditional: 316, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 262, Positive conditional cache size: 22, Positive unconditional cache size: 240, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 396, independent conditional: 396, 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: 430, independent: 396, independent conditional: 162, independent unconditional: 234, 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: 430, independent: 396, independent conditional: 92, independent unconditional: 304, 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: 430, independent: 396, independent conditional: 92, independent unconditional: 304, 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: 1, independent: 1, independent conditional: 1, 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: 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: 430, independent: 395, independent conditional: 91, independent unconditional: 304, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 263, Positive conditional cache size: 23, Positive unconditional cache size: 240, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 428, independent: 394, independent conditional: 394, 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: 428, independent: 394, independent conditional: 144, independent unconditional: 250, 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: 428, independent: 394, independent conditional: 74, independent unconditional: 320, 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: 428, independent: 394, independent conditional: 74, independent unconditional: 320, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 428, independent: 394, independent conditional: 74, independent unconditional: 320, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 263, Positive conditional cache size: 23, Positive unconditional cache size: 240, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 54, 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: 60, independent: 54, independent conditional: 22, independent unconditional: 32, 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: 60, independent: 54, independent conditional: 16, independent unconditional: 38, 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: 60, independent: 54, independent conditional: 16, independent unconditional: 38, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 60, independent: 54, independent conditional: 16, independent unconditional: 38, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 263, Positive conditional cache size: 23, Positive unconditional cache size: 240, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, 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, 65 PlacesBefore, 65 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 882 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 264, independent conditional: 264, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 276, independent: 264, independent conditional: 156, independent unconditional: 108, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 264, independent conditional: 120, independent unconditional: 144, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 264, independent conditional: 120, independent unconditional: 144, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, independent: 248, independent conditional: 111, independent unconditional: 137, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 305, Positive conditional cache size: 32, Positive unconditional cache size: 273, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 68 PlacesBefore, 67 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, independent: 201, independent conditional: 201, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 219, independent: 201, independent conditional: 120, independent unconditional: 81, dependent: 18, dependent conditional: 9, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, independent: 201, independent conditional: 75, independent unconditional: 126, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 219, independent: 201, independent conditional: 75, independent unconditional: 126, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 4, independent conditional: 0, independent unconditional: 4, 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: 219, independent: 197, independent conditional: 71, independent unconditional: 126, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 317, Positive conditional cache size: 36, Positive unconditional cache size: 281, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 69, independent conditional: 69, 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: 75, independent: 69, independent conditional: 42, independent unconditional: 27, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 69, independent conditional: 24, independent unconditional: 45, 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: 75, independent: 69, independent conditional: 24, independent unconditional: 45, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 69, independent conditional: 24, independent unconditional: 45, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 317, Positive conditional cache size: 36, Positive unconditional cache size: 281, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 46, independent conditional: 20, independent unconditional: 26, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 46, independent conditional: 8, independent unconditional: 38, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 46, independent conditional: 8, independent unconditional: 38, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 41, independent conditional: 8, independent unconditional: 33, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 322, Positive conditional cache size: 36, Positive unconditional cache size: 286, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, 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: 93.1s, 72 PlacesBefore, 70 PlacesAfterwards, 58 TransitionsBefore, 56 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 77, independent conditional: 77, 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: 83, independent: 77, independent conditional: 47, independent unconditional: 30, 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: 83, independent: 77, independent conditional: 30, independent unconditional: 47, 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: 83, independent: 77, independent conditional: 30, independent unconditional: 47, 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: 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: 83, independent: 75, independent conditional: 30, independent unconditional: 45, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 349, Positive conditional cache size: 38, Positive unconditional cache size: 311, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 64 PlacesBefore, 57 PlacesAfterwards, 35 TransitionsBefore, 28 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 61, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 70, independent conditional: 9, independent unconditional: 61, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 70, independent conditional: 9, independent unconditional: 61, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 70, independent: 68, independent conditional: 7, independent unconditional: 61, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 566, Positive conditional cache size: 52, Positive unconditional cache size: 514, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:06:40,591 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...