/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:52:45,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:52:45,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:52:45,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:52:45,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:52:45,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:52:45,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:52:45,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:52:45,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:52:45,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:52:45,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:52:45,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:52:45,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:52:45,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:52:45,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:52:45,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:52:45,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:52:45,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:52:45,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:52:45,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:52:45,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:52:45,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:52:45,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:52:45,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:52:45,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:52:45,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:52:45,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:52:45,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:52:45,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:52:45,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:52:45,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:52:45,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:52:45,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:52:45,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:52:45,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:52:45,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:52:45,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:52:45,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:52:45,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:52:45,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:52:45,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:52:45,933 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:52:45,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:52:45,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:52:45,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:52:45,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:52:45,961 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:52:45,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:52:45,961 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:52:45,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:52:45,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:52:45,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:52:45,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:52:45,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:52:45,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:52:45,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:52:45,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:45,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:52:45,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:52:45,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:52:45,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:52:45,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:52:45,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:52:45,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:52:46,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:52:46,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:52:46,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:52:46,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:52:46,253 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:52:46,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2022-12-13 11:52:47,296 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:52:47,519 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:52:47,519 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2022-12-13 11:52:47,532 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02fc799/62a20e31a314464780cd3cb2f7c3a4f8/FLAG72c260b6b [2022-12-13 11:52:47,545 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb02fc799/62a20e31a314464780cd3cb2f7c3a4f8 [2022-12-13 11:52:47,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:52:47,548 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:52:47,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:47,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:52:47,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:52:47,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2763aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47, skipping insertion in model container [2022-12-13 11:52:47,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:52:47,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:52:47,668 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/mix039.opt.i[944,957] [2022-12-13 11:52:47,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:47,784 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:52:47,790 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/mix039.opt.i[944,957] [2022-12-13 11:52:47,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:52:47,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:52:47,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:52:47,845 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:52:47,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47 WrapperNode [2022-12-13 11:52:47,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:52:47,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:47,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:52:47,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:52:47,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,904 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-13 11:52:47,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:52:47,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:52:47,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:52:47,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:52:47,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,929 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:52:47,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:52:47,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:52:47,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:52:47,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (1/1) ... [2022-12-13 11:52:47,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:52:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:52:47,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:52:48,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:52:48,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:52:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:52:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:52:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:52:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:52:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:52:48,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:52:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:52:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:52:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:52:48,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:52:48,014 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:52:48,189 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:52:48,191 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:52:48,477 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:52:48,576 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:52:48,576 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:52:48,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:48 BoogieIcfgContainer [2022-12-13 11:52:48,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:52:48,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:52:48,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:52:48,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:52:48,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:52:47" (1/3) ... [2022-12-13 11:52:48,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23350cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:48, skipping insertion in model container [2022-12-13 11:52:48,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:52:47" (2/3) ... [2022-12-13 11:52:48,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23350cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:52:48, skipping insertion in model container [2022-12-13 11:52:48,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:52:48" (3/3) ... [2022-12-13 11:52:48,583 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2022-12-13 11:52:48,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:52:48,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:52:48,613 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:52:48,662 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:52:48,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 11:52:48,719 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 11:52:48,720 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:48,724 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 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:52:48,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 11:52:48,727 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 11:52:48,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:48,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 11:52:48,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 11:52:48,760 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 11:52:48,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:48,761 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 67 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 11:52:48,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 11:52:48,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-13 11:52:53,438 INFO L241 LiptonReduction]: Total number of compositions: 101 [2022-12-13 11:52:53,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:52:53,459 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;@303efbfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:52:53,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:52:53,464 INFO L130 PetriNetUnfolder]: 1/30 cut-off events. [2022-12-13 11:52:53,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:53,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:53,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:53,465 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-13 11:52:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:53,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2128013267, now seen corresponding path program 1 times [2022-12-13 11:52:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:53,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066464127] [2022-12-13 11:52:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:53,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066464127] [2022-12-13 11:52:53,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066464127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:53,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:53,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560116261] [2022-12-13 11:52:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:53,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:53,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:53,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 66 [2022-12-13 11:52:53,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:53,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:53,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 66 [2022-12-13 11:52:53,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:58,084 INFO L130 PetriNetUnfolder]: 40551/60441 cut-off events. [2022-12-13 11:52:58,084 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-13 11:52:58,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114361 conditions, 60441 events. 40551/60441 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 3760. Compared 497747 event pairs, 5311 based on Foata normal form. 0/35874 useless extension candidates. Maximal degree in co-relation 114349. Up to 46041 conditions per place. [2022-12-13 11:52:58,308 INFO L137 encePairwiseOnDemand]: 60/66 looper letters, 36 selfloop transitions, 3 changer transitions 46/99 dead transitions. [2022-12-13 11:52:58,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 380 flow [2022-12-13 11:52:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-12-13 11:52:58,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 11:52:58,318 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 144 flow. Second operand 3 states and 132 transitions. [2022-12-13 11:52:58,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 380 flow [2022-12-13 11:52:58,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:52:58,324 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 94 flow [2022-12-13 11:52:58,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2022-12-13 11:52:58,328 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-12-13 11:52:58,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:58,329 INFO L89 Accepts]: Start accepts. Operand has 74 places, 40 transitions, 94 flow [2022-12-13 11:52:58,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:58,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:58,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 40 transitions, 94 flow [2022-12-13 11:52:58,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 94 flow [2022-12-13 11:52:58,339 INFO L130 PetriNetUnfolder]: 0/40 cut-off events. [2022-12-13 11:52:58,339 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:58,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 94 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:52:58,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 94 flow [2022-12-13 11:52:58,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 954 [2022-12-13 11:52:58,637 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:58,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-13 11:52:58,640 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 94 flow [2022-12-13 11:52:58,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:58,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:58,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:58,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:52:58,644 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-13 11:52:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 616314952, now seen corresponding path program 1 times [2022-12-13 11:52:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:58,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137032364] [2022-12-13 11:52:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:52:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:52:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:52:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137032364] [2022-12-13 11:52:58,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137032364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:52:58,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:52:58,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:52:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606408629] [2022-12-13 11:52:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:52:58,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:52:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:52:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:52:58,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:52:58,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2022-12-13 11:52:58,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:58,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:52:58,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2022-12-13 11:52:58,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:52:59,807 INFO L130 PetriNetUnfolder]: 9317/13283 cut-off events. [2022-12-13 11:52:59,807 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-13 11:52:59,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27039 conditions, 13283 events. 9317/13283 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 80214 event pairs, 3139 based on Foata normal form. 0/9582 useless extension candidates. Maximal degree in co-relation 27029. Up to 11887 conditions per place. [2022-12-13 11:52:59,871 INFO L137 encePairwiseOnDemand]: 36/40 looper letters, 41 selfloop transitions, 3 changer transitions 2/58 dead transitions. [2022-12-13 11:52:59,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 230 flow [2022-12-13 11:52:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:52:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:52:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 11:52:59,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2022-12-13 11:52:59,874 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 94 flow. Second operand 3 states and 83 transitions. [2022-12-13 11:52:59,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 230 flow [2022-12-13 11:52:59,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:52:59,877 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 105 flow [2022-12-13 11:52:59,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-13 11:52:59,878 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2022-12-13 11:52:59,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:52:59,878 INFO L89 Accepts]: Start accepts. Operand has 52 places, 41 transitions, 105 flow [2022-12-13 11:52:59,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:52:59,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:52:59,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 105 flow [2022-12-13 11:52:59,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 105 flow [2022-12-13 11:52:59,885 INFO L130 PetriNetUnfolder]: 3/53 cut-off events. [2022-12-13 11:52:59,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:52:59,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 53 events. 3/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 151 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 68. Up to 10 conditions per place. [2022-12-13 11:52:59,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 105 flow [2022-12-13 11:52:59,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-13 11:52:59,902 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:52:59,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:52:59,903 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 105 flow [2022-12-13 11:52:59,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:52:59,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:52:59,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:52:59,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:52:59,910 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-13 11:52:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:52:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1925892155, now seen corresponding path program 1 times [2022-12-13 11:52:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:52:59,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097893704] [2022-12-13 11:52:59,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:52:59,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:52:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:00,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097893704] [2022-12-13 11:53:00,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097893704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:00,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:00,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:53:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636478314] [2022-12-13 11:53:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:00,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:00,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:00,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 11:53:00,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:00,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:00,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 11:53:00,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:01,251 INFO L130 PetriNetUnfolder]: 15014/21361 cut-off events. [2022-12-13 11:53:01,251 INFO L131 PetriNetUnfolder]: For 2259/2259 co-relation queries the response was YES. [2022-12-13 11:53:01,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44688 conditions, 21361 events. 15014/21361 cut-off events. For 2259/2259 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 123137 event pairs, 4004 based on Foata normal form. 720/17534 useless extension candidates. Maximal degree in co-relation 44677. Up to 10641 conditions per place. [2022-12-13 11:53:01,389 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 55 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2022-12-13 11:53:01,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 309 flow [2022-12-13 11:53:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 11:53:01,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2022-12-13 11:53:01,390 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 105 flow. Second operand 4 states and 98 transitions. [2022-12-13 11:53:01,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 309 flow [2022-12-13 11:53:01,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:01,392 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 166 flow [2022-12-13 11:53:01,392 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-12-13 11:53:01,393 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -22 predicate places. [2022-12-13 11:53:01,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:01,393 INFO L89 Accepts]: Start accepts. Operand has 56 places, 46 transitions, 166 flow [2022-12-13 11:53:01,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:01,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:01,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 46 transitions, 166 flow [2022-12-13 11:53:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 166 flow [2022-12-13 11:53:01,414 INFO L130 PetriNetUnfolder]: 89/309 cut-off events. [2022-12-13 11:53:01,414 INFO L131 PetriNetUnfolder]: For 119/133 co-relation queries the response was YES. [2022-12-13 11:53:01,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 309 events. 89/309 cut-off events. For 119/133 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1938 event pairs, 35 based on Foata normal form. 2/198 useless extension candidates. Maximal degree in co-relation 607. Up to 131 conditions per place. [2022-12-13 11:53:01,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 46 transitions, 166 flow [2022-12-13 11:53:01,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-13 11:53:01,432 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:01,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 11:53:01,433 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 166 flow [2022-12-13 11:53:01,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:01,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:01,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:01,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:53:01,434 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-13 11:53:01,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:01,434 INFO L85 PathProgramCache]: Analyzing trace with hash -281700507, now seen corresponding path program 1 times [2022-12-13 11:53:01,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:01,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737392316] [2022-12-13 11:53:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:01,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737392316] [2022-12-13 11:53:01,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737392316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:01,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:01,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:01,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634587096] [2022-12-13 11:53:01,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:01,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:01,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:53:01,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:01,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:01,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:53:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:04,077 INFO L130 PetriNetUnfolder]: 27850/38694 cut-off events. [2022-12-13 11:53:04,078 INFO L131 PetriNetUnfolder]: For 15610/16094 co-relation queries the response was YES. [2022-12-13 11:53:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88918 conditions, 38694 events. 27850/38694 cut-off events. For 15610/16094 co-relation queries the response was YES. Maximal size of possible extension queue 2699. Compared 258671 event pairs, 9622 based on Foata normal form. 2311/24887 useless extension candidates. Maximal degree in co-relation 88903. Up to 30430 conditions per place. [2022-12-13 11:53:04,344 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 76 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2022-12-13 11:53:04,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 116 transitions, 570 flow [2022-12-13 11:53:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:53:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:53:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2022-12-13 11:53:04,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7210526315789474 [2022-12-13 11:53:04,348 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 166 flow. Second operand 5 states and 137 transitions. [2022-12-13 11:53:04,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 116 transitions, 570 flow [2022-12-13 11:53:04,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 560 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:04,357 INFO L231 Difference]: Finished difference. Result has 61 places, 71 transitions, 357 flow [2022-12-13 11:53:04,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2022-12-13 11:53:04,358 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2022-12-13 11:53:04,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:04,358 INFO L89 Accepts]: Start accepts. Operand has 61 places, 71 transitions, 357 flow [2022-12-13 11:53:04,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:04,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:04,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 357 flow [2022-12-13 11:53:04,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 357 flow [2022-12-13 11:53:05,115 INFO L130 PetriNetUnfolder]: 10354/15475 cut-off events. [2022-12-13 11:53:05,115 INFO L131 PetriNetUnfolder]: For 4382/8824 co-relation queries the response was YES. [2022-12-13 11:53:05,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45649 conditions, 15475 events. 10354/15475 cut-off events. For 4382/8824 co-relation queries the response was YES. Maximal size of possible extension queue 2190. Compared 121483 event pairs, 5755 based on Foata normal form. 8/6359 useless extension candidates. Maximal degree in co-relation 45633. Up to 13427 conditions per place. [2022-12-13 11:53:05,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 357 flow [2022-12-13 11:53:05,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 1752 [2022-12-13 11:53:05,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L758-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_193 (+ v_~__unbuffered_cnt~0_194 1)) (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_194} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:53:05,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [457] L839-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_13|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-13 11:53:05,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] L801-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 11:53:05,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [359] L773-->L778: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:05,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [365] L801-->L806: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:05,470 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [353] L758-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:05,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [503] L773-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:53:05,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [424] L801-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 11:53:05,532 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [375] L839-->L842: Formula: (= (+ v_~__unbuffered_cnt~0_8 1) v_~__unbuffered_cnt~0_7) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:05,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [520] L758-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_189 (+ v_~__unbuffered_cnt~0_190 1)) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_190} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_189} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:53:05,570 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_157 (+ v_~__unbuffered_cnt~0_158 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:53:05,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [422] L839-->P3FINAL: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res#1.offset_5|) (= |v_P3Thread1of1ForFork2_#res#1.base_5| 0) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_5|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-13 11:53:05,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:53:05,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1487 [2022-12-13 11:53:05,845 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 70 transitions, 399 flow [2022-12-13 11:53:05,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:05,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:05,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:05,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:53:05,848 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-13 11:53:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 726180648, now seen corresponding path program 1 times [2022-12-13 11:53:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483305603] [2022-12-13 11:53:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:05,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:05,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483305603] [2022-12-13 11:53:05,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483305603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:05,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:05,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:53:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86613098] [2022-12-13 11:53:05,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:05,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:53:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:05,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:53:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:53:05,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2022-12-13 11:53:05,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 70 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:05,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:05,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2022-12-13 11:53:05,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:08,602 INFO L130 PetriNetUnfolder]: 25015/36430 cut-off events. [2022-12-13 11:53:08,602 INFO L131 PetriNetUnfolder]: For 21847/26883 co-relation queries the response was YES. [2022-12-13 11:53:08,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132301 conditions, 36430 events. 25015/36430 cut-off events. For 21847/26883 co-relation queries the response was YES. Maximal size of possible extension queue 2754. Compared 264461 event pairs, 3577 based on Foata normal form. 2264/23291 useless extension candidates. Maximal degree in co-relation 132282. Up to 23896 conditions per place. [2022-12-13 11:53:08,759 INFO L137 encePairwiseOnDemand]: 23/50 looper letters, 88 selfloop transitions, 50 changer transitions 1/153 dead transitions. [2022-12-13 11:53:08,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 153 transitions, 1063 flow [2022-12-13 11:53:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:53:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:53:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-12-13 11:53:08,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 11:53:08,761 INFO L175 Difference]: Start difference. First operand has 60 places, 70 transitions, 399 flow. Second operand 6 states and 180 transitions. [2022-12-13 11:53:08,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 153 transitions, 1063 flow [2022-12-13 11:53:08,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 153 transitions, 1026 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:08,780 INFO L231 Difference]: Finished difference. Result has 67 places, 95 transitions, 726 flow [2022-12-13 11:53:08,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=726, PETRI_PLACES=67, PETRI_TRANSITIONS=95} [2022-12-13 11:53:08,780 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -11 predicate places. [2022-12-13 11:53:08,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:08,780 INFO L89 Accepts]: Start accepts. Operand has 67 places, 95 transitions, 726 flow [2022-12-13 11:53:08,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:08,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:08,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 95 transitions, 726 flow [2022-12-13 11:53:08,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 95 transitions, 726 flow [2022-12-13 11:53:09,761 INFO L130 PetriNetUnfolder]: 9742/15495 cut-off events. [2022-12-13 11:53:09,762 INFO L131 PetriNetUnfolder]: For 15244/38558 co-relation queries the response was YES. [2022-12-13 11:53:09,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73997 conditions, 15495 events. 9742/15495 cut-off events. For 15244/38558 co-relation queries the response was YES. Maximal size of possible extension queue 2367. Compared 131470 event pairs, 2401 based on Foata normal form. 23/6368 useless extension candidates. Maximal degree in co-relation 73977. Up to 13780 conditions per place. [2022-12-13 11:53:09,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 95 transitions, 726 flow [2022-12-13 11:53:09,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 2492 [2022-12-13 11:53:15,311 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:53:15,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6532 [2022-12-13 11:53:15,312 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 94 transitions, 718 flow [2022-12-13 11:53:15,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:15,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:15,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:15,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:53:15,312 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-13 11:53:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1279896001, now seen corresponding path program 1 times [2022-12-13 11:53:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494580365] [2022-12-13 11:53:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:15,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494580365] [2022-12-13 11:53:15,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494580365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:15,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:15,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092939573] [2022-12-13 11:53:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:15,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:15,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2022-12-13 11:53:15,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 94 transitions, 718 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:15,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:15,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2022-12-13 11:53:15,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:18,838 INFO L130 PetriNetUnfolder]: 30513/44738 cut-off events. [2022-12-13 11:53:18,838 INFO L131 PetriNetUnfolder]: For 97012/106812 co-relation queries the response was YES. [2022-12-13 11:53:19,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214389 conditions, 44738 events. 30513/44738 cut-off events. For 97012/106812 co-relation queries the response was YES. Maximal size of possible extension queue 2335. Compared 316650 event pairs, 4781 based on Foata normal form. 1237/36314 useless extension candidates. Maximal degree in co-relation 214366. Up to 27965 conditions per place. [2022-12-13 11:53:19,141 INFO L137 encePairwiseOnDemand]: 41/50 looper letters, 122 selfloop transitions, 19 changer transitions 59/217 dead transitions. [2022-12-13 11:53:19,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 217 transitions, 2034 flow [2022-12-13 11:53:19,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:53:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:53:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2022-12-13 11:53:19,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.656 [2022-12-13 11:53:19,142 INFO L175 Difference]: Start difference. First operand has 67 places, 94 transitions, 718 flow. Second operand 5 states and 164 transitions. [2022-12-13 11:53:19,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 217 transitions, 2034 flow [2022-12-13 11:53:20,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 217 transitions, 1707 flow, removed 107 selfloop flow, removed 3 redundant places. [2022-12-13 11:53:20,052 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 559 flow [2022-12-13 11:53:20,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2022-12-13 11:53:20,053 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -7 predicate places. [2022-12-13 11:53:20,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:20,053 INFO L89 Accepts]: Start accepts. Operand has 71 places, 84 transitions, 559 flow [2022-12-13 11:53:20,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:20,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:20,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 84 transitions, 559 flow [2022-12-13 11:53:20,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 84 transitions, 559 flow [2022-12-13 11:53:20,904 INFO L130 PetriNetUnfolder]: 10035/16329 cut-off events. [2022-12-13 11:53:20,904 INFO L131 PetriNetUnfolder]: For 20134/25276 co-relation queries the response was YES. [2022-12-13 11:53:20,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71924 conditions, 16329 events. 10035/16329 cut-off events. For 20134/25276 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 138979 event pairs, 3139 based on Foata normal form. 94/8097 useless extension candidates. Maximal degree in co-relation 71902. Up to 13150 conditions per place. [2022-12-13 11:53:21,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 84 transitions, 559 flow [2022-12-13 11:53:21,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 2288 [2022-12-13 11:53:21,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:21,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1135 [2022-12-13 11:53:21,188 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 84 transitions, 559 flow [2022-12-13 11:53:21,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:21,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:21,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:21,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:53:21,189 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-13 11:53:21,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash 263269140, now seen corresponding path program 1 times [2022-12-13 11:53:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:21,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222119919] [2022-12-13 11:53:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:21,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222119919] [2022-12-13 11:53:21,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222119919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:21,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:21,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:53:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877093709] [2022-12-13 11:53:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:21,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:53:21,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:21,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:53:21,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:53:21,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2022-12-13 11:53:21,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 84 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:21,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:21,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2022-12-13 11:53:21,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:23,594 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 53#L801true, P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 179#true, Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:23,595 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,595 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,595 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,595 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,598 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, 53#L801true, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:23,598 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,598 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,599 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,599 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,776 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 53#L801true, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, 176#true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:23,777 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,777 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,777 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,777 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,781 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 53#L801true, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 105#P1EXITtrue, Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:23,781 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,781 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,781 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,781 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,848 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 164#true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, 53#L801true, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:23,848 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,848 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,849 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,849 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,853 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 164#true, P2Thread1of1ForFork0InUse, 53#L801true, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 105#P1EXITtrue, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:23,853 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,853 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,853 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:23,853 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 11:53:24,172 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][72], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 225#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 179#true, Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 178#true]) [2022-12-13 11:53:24,173 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,173 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,173 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,173 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,174 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][72], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 178#true]) [2022-12-13 11:53:24,174 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,174 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,174 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,174 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,175 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= v_~main$tmp_guard1~0_34 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_35 1) (= v_~y~0_43 2) (= v_~__unbuffered_p2_EAX~0_44 0) (= v_~__unbuffered_p0_EAX~0_38 0) (= 0 v_~__unbuffered_p3_EBX~0_38))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][118], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 118#L832true, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), 178#true, Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,175 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,175 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,175 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,176 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,176 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= v_~main$tmp_guard1~0_34 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_35 1) (= v_~y~0_43 2) (= v_~__unbuffered_p2_EAX~0_44 0) (= v_~__unbuffered_p0_EAX~0_38 0) (= 0 v_~__unbuffered_p3_EBX~0_38))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][118], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, 63#P2EXITtrue, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 118#L832true, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), 178#true, Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,176 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,176 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,176 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,176 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,181 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][72], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 176#true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,181 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,182 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,182 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,182 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,182 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][72], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 176#true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,182 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,183 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,183 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,183 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,184 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= v_~main$tmp_guard1~0_34 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_35 1) (= v_~y~0_43 2) (= v_~__unbuffered_p2_EAX~0_44 0) (= v_~__unbuffered_p0_EAX~0_38 0) (= 0 v_~__unbuffered_p3_EBX~0_38))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][118], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 118#L832true, Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,184 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,184 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,184 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,185 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,185 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= v_~main$tmp_guard1~0_34 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_35 1) (= v_~y~0_43 2) (= v_~__unbuffered_p2_EAX~0_44 0) (= v_~__unbuffered_p0_EAX~0_38 0) (= 0 v_~__unbuffered_p3_EBX~0_38))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][118], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 118#L832true, Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,185 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,185 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,185 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,185 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,190 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][72], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 158#true, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,190 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,190 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,190 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,191 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,191 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][72], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 225#true, 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,191 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,191 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,192 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,192 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,193 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= v_~main$tmp_guard1~0_34 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_35 1) (= v_~y~0_43 2) (= v_~__unbuffered_p2_EAX~0_44 0) (= v_~__unbuffered_p0_EAX~0_38 0) (= 0 v_~__unbuffered_p3_EBX~0_38))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][118], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 118#L832true, P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 158#true, 225#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 179#true, Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,193 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,193 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,193 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,193 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,194 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([493] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|) (= v_~main$tmp_guard1~0_34 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_35 1) (= v_~y~0_43 2) (= v_~__unbuffered_p2_EAX~0_44 0) (= v_~__unbuffered_p0_EAX~0_38 0) (= 0 v_~__unbuffered_p3_EBX~0_38))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_31| 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_31|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_25|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_38, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][118], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 118#L832true, P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 119#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 225#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 179#true, Black: 208#(<= ~__unbuffered_cnt~0 1), Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,194 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,194 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,194 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,194 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,251 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 227#(= ~y~0 1), 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,251 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,251 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,251 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,251 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,252 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,252 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,252 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 227#(= ~y~0 1), 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,254 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,254 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, 105#P1EXITtrue, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), 179#true, Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,255 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,255 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,322 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 158#true, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, 176#true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,322 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,322 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,322 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,322 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,323 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 63#P2EXITtrue, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, 176#true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,323 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,323 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,323 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,323 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,324 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, P3Thread1of1ForFork2InUse, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 158#true, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,324 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 63#P2EXITtrue, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, P3Thread1of1ForFork2InUse, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,325 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,325 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 164#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,400 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 164#true, 63#P2EXITtrue, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), 176#true, Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,400 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,400 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 164#true, P2Thread1of1ForFork0InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,402 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 189#true, Black: 191#(= ~__unbuffered_p3_EAX~0 0), 59#L839true, 164#true, 63#P2EXITtrue, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,402 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,402 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,527 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,677 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, 59#L839true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 158#true, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), 178#true, Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,677 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,677 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,677 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,677 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,678 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, 59#L839true, 63#P2EXITtrue, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 198#(<= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 217#(= ~x~0 1), P1Thread1of1ForFork3InUse, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, 98#P0EXITtrue, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), 178#true, Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,678 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,678 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,678 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,678 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,679 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, 59#L839true, 164#true, P2Thread1of1ForFork0InUse, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 158#true, 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), 178#true, Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,679 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,679 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,679 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,679 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,680 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([374] L832-->L839: Formula: (let ((.cse0 (not (= (mod v_~z$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0)))) (let ((.cse3 (and (not (= (mod v_~z$w_buff1_used~0_61 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_74 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= v_~z~0_44 (ite .cse2 v_~z$w_buff0~0_33 (ite .cse3 v_~z$w_buff1~0_32 v_~z~0_45))) (= (ite (or .cse4 .cse3) 0 v_~z$w_buff1_used~0_61) v_~z$w_buff1_used~0_60) (= v_~z$r_buff0_thd4~0_32 (ite .cse4 0 v_~z$r_buff0_thd4~0_33)) (= (ite .cse2 0 v_~z$w_buff0_used~0_74) v_~z$w_buff0_used~0_73)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_74, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_45} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_73, ~z$w_buff0~0=v_~z$w_buff0~0_33, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, ~z$w_buff1~0=v_~z$w_buff1~0_32, ~z~0=v_~z~0_44} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][95], [Black: 192#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 191#(= ~__unbuffered_p3_EAX~0 0), 189#true, 59#L839true, 164#true, P2Thread1of1ForFork0InUse, 63#P2EXITtrue, P0Thread1of1ForFork1InUse, Black: 201#(and (<= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 199#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, Black: 198#(<= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 217#(= ~x~0 1), 227#(= ~y~0 1), Black: 211#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(<= ~__unbuffered_cnt~0 1), 78#L874true, Black: 187#(= ~y~0 0), Black: 220#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), 178#true, Black: 218#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))]) [2022-12-13 11:53:24,680 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,680 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,680 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:24,680 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 11:53:25,039 INFO L130 PetriNetUnfolder]: 29509/43729 cut-off events. [2022-12-13 11:53:25,040 INFO L131 PetriNetUnfolder]: For 108424/114687 co-relation queries the response was YES. [2022-12-13 11:53:25,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205948 conditions, 43729 events. 29509/43729 cut-off events. For 108424/114687 co-relation queries the response was YES. Maximal size of possible extension queue 2804. Compared 325572 event pairs, 9137 based on Foata normal form. 1277/34792 useless extension candidates. Maximal degree in co-relation 205923. Up to 28309 conditions per place. [2022-12-13 11:53:25,491 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 81 selfloop transitions, 11 changer transitions 0/119 dead transitions. [2022-12-13 11:53:25,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 949 flow [2022-12-13 11:53:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:53:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:53:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 11:53:25,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2022-12-13 11:53:25,492 INFO L175 Difference]: Start difference. First operand has 68 places, 84 transitions, 559 flow. Second operand 3 states and 82 transitions. [2022-12-13 11:53:25,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 949 flow [2022-12-13 11:53:26,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 899 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-12-13 11:53:26,542 INFO L231 Difference]: Finished difference. Result has 69 places, 84 transitions, 564 flow [2022-12-13 11:53:26,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=69, PETRI_TRANSITIONS=84} [2022-12-13 11:53:26,543 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -9 predicate places. [2022-12-13 11:53:26,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:26,543 INFO L89 Accepts]: Start accepts. Operand has 69 places, 84 transitions, 564 flow [2022-12-13 11:53:26,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:26,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:26,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 84 transitions, 564 flow [2022-12-13 11:53:26,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 84 transitions, 564 flow [2022-12-13 11:53:27,945 INFO L130 PetriNetUnfolder]: 14775/23351 cut-off events. [2022-12-13 11:53:27,946 INFO L131 PetriNetUnfolder]: For 18259/41473 co-relation queries the response was YES. [2022-12-13 11:53:28,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84265 conditions, 23351 events. 14775/23351 cut-off events. For 18259/41473 co-relation queries the response was YES. Maximal size of possible extension queue 3333. Compared 201052 event pairs, 4760 based on Foata normal form. 101/10955 useless extension candidates. Maximal degree in co-relation 84243. Up to 19576 conditions per place. [2022-12-13 11:53:28,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 84 transitions, 564 flow [2022-12-13 11:53:28,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 2286 [2022-12-13 11:53:28,271 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:28,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1729 [2022-12-13 11:53:28,272 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 84 transitions, 564 flow [2022-12-13 11:53:28,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:28,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:28,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:28,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:53:28,272 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-13 11:53:28,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:28,273 INFO L85 PathProgramCache]: Analyzing trace with hash 646975105, now seen corresponding path program 1 times [2022-12-13 11:53:28,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:28,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181849110] [2022-12-13 11:53:28,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:28,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:28,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181849110] [2022-12-13 11:53:28,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181849110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:28,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:28,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:53:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122083096] [2022-12-13 11:53:28,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:28,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:53:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:53:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:53:28,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2022-12-13 11:53:28,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 84 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:28,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:28,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2022-12-13 11:53:28,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:32,873 INFO L130 PetriNetUnfolder]: 42858/63316 cut-off events. [2022-12-13 11:53:32,873 INFO L131 PetriNetUnfolder]: For 116542/123698 co-relation queries the response was YES. [2022-12-13 11:53:33,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261445 conditions, 63316 events. 42858/63316 cut-off events. For 116542/123698 co-relation queries the response was YES. Maximal size of possible extension queue 3975. Compared 489046 event pairs, 11227 based on Foata normal form. 1572/49968 useless extension candidates. Maximal degree in co-relation 261420. Up to 42309 conditions per place. [2022-12-13 11:53:33,189 INFO L137 encePairwiseOnDemand]: 35/38 looper letters, 118 selfloop transitions, 5 changer transitions 1/155 dead transitions. [2022-12-13 11:53:33,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 155 transitions, 1229 flow [2022-12-13 11:53:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:53:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:53:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2022-12-13 11:53:33,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2022-12-13 11:53:33,191 INFO L175 Difference]: Start difference. First operand has 69 places, 84 transitions, 564 flow. Second operand 4 states and 112 transitions. [2022-12-13 11:53:33,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 155 transitions, 1229 flow [2022-12-13 11:53:33,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 155 transitions, 1207 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:33,228 INFO L231 Difference]: Finished difference. Result has 73 places, 85 transitions, 579 flow [2022-12-13 11:53:33,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=579, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2022-12-13 11:53:33,230 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2022-12-13 11:53:33,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:33,230 INFO L89 Accepts]: Start accepts. Operand has 73 places, 85 transitions, 579 flow [2022-12-13 11:53:33,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:33,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:33,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 85 transitions, 579 flow [2022-12-13 11:53:33,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 85 transitions, 579 flow [2022-12-13 11:53:35,111 INFO L130 PetriNetUnfolder]: 21998/33952 cut-off events. [2022-12-13 11:53:35,111 INFO L131 PetriNetUnfolder]: For 25328/71372 co-relation queries the response was YES. [2022-12-13 11:53:35,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122780 conditions, 33952 events. 21998/33952 cut-off events. For 25328/71372 co-relation queries the response was YES. Maximal size of possible extension queue 4836. Compared 295185 event pairs, 7126 based on Foata normal form. 108/15342 useless extension candidates. Maximal degree in co-relation 122756. Up to 29188 conditions per place. [2022-12-13 11:53:35,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 85 transitions, 579 flow [2022-12-13 11:53:35,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 2314 [2022-12-13 11:53:35,729 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:53:35,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2501 [2022-12-13 11:53:35,731 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 579 flow [2022-12-13 11:53:35,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:35,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:35,732 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:35,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:53:35,732 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-13 11:53:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2099017651, now seen corresponding path program 1 times [2022-12-13 11:53:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857345376] [2022-12-13 11:53:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:35,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857345376] [2022-12-13 11:53:35,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857345376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:35,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:35,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:53:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877048134] [2022-12-13 11:53:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:35,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:53:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:35,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:53:35,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:53:35,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 11:53:35,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 579 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:35,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:35,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 11:53:35,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:40,134 INFO L130 PetriNetUnfolder]: 34185/53568 cut-off events. [2022-12-13 11:53:40,134 INFO L131 PetriNetUnfolder]: For 62855/68455 co-relation queries the response was YES. [2022-12-13 11:53:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224252 conditions, 53568 events. 34185/53568 cut-off events. For 62855/68455 co-relation queries the response was YES. Maximal size of possible extension queue 3807. Compared 459627 event pairs, 1674 based on Foata normal form. 5608/36736 useless extension candidates. Maximal degree in co-relation 224225. Up to 36073 conditions per place. [2022-12-13 11:53:40,403 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 81 selfloop transitions, 47 changer transitions 41/190 dead transitions. [2022-12-13 11:53:40,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 190 transitions, 1629 flow [2022-12-13 11:53:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:53:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:53:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2022-12-13 11:53:40,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7406015037593985 [2022-12-13 11:53:40,405 INFO L175 Difference]: Start difference. First operand has 73 places, 85 transitions, 579 flow. Second operand 7 states and 197 transitions. [2022-12-13 11:53:40,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 190 transitions, 1629 flow [2022-12-13 11:53:40,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 190 transitions, 1622 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:53:40,650 INFO L231 Difference]: Finished difference. Result has 81 places, 103 transitions, 883 flow [2022-12-13 11:53:40,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=883, PETRI_PLACES=81, PETRI_TRANSITIONS=103} [2022-12-13 11:53:40,652 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2022-12-13 11:53:40,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:53:40,653 INFO L89 Accepts]: Start accepts. Operand has 81 places, 103 transitions, 883 flow [2022-12-13 11:53:40,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:53:40,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:53:40,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 103 transitions, 883 flow [2022-12-13 11:53:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 103 transitions, 883 flow [2022-12-13 11:53:42,556 INFO L130 PetriNetUnfolder]: 13611/25629 cut-off events. [2022-12-13 11:53:42,557 INFO L131 PetriNetUnfolder]: For 39397/96364 co-relation queries the response was YES. [2022-12-13 11:53:42,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130031 conditions, 25629 events. 13611/25629 cut-off events. For 39397/96364 co-relation queries the response was YES. Maximal size of possible extension queue 4077. Compared 274287 event pairs, 1452 based on Foata normal form. 28/12024 useless extension candidates. Maximal degree in co-relation 130003. Up to 22465 conditions per place. [2022-12-13 11:53:42,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 103 transitions, 883 flow [2022-12-13 11:53:42,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 2506 [2022-12-13 11:53:42,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [503] L773-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= |v_P1Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:53:42,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [504] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_157 (+ v_~__unbuffered_cnt~0_158 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-13 11:53:42,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [365] L801-->L806: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:43,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [353] L758-->L763: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:43,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [424] L801-->P2FINAL: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 11:53:43,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [521] L758-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_193 (+ v_~__unbuffered_cnt~0_194 1)) (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_194} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:53:43,083 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] L801-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_111 (+ v_~__unbuffered_cnt~0_112 1)) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-13 11:53:43,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [520] L758-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_189 (+ v_~__unbuffered_cnt~0_190 1)) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_190} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_189} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-13 11:53:43,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L863-3-->L867: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_89 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [359] L773-->L778: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 11:53:48,627 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:53:48,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7975 [2022-12-13 11:53:48,627 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 102 transitions, 909 flow [2022-12-13 11:53:48,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:48,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:53:48,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:53:48,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:53:48,628 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-13 11:53:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:53:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1241246616, now seen corresponding path program 1 times [2022-12-13 11:53:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:53:48,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403175243] [2022-12-13 11:53:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:53:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:53:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:53:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:53:48,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:53:48,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403175243] [2022-12-13 11:53:48,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403175243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:53:48,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:53:48,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:53:48,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044677752] [2022-12-13 11:53:48,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:53:48,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:53:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:53:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:53:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:53:48,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2022-12-13 11:53:48,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 102 transitions, 909 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:53:48,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:53:48,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2022-12-13 11:53:48,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:53:52,032 INFO L130 PetriNetUnfolder]: 24008/39018 cut-off events. [2022-12-13 11:53:52,033 INFO L131 PetriNetUnfolder]: For 79669/85486 co-relation queries the response was YES. [2022-12-13 11:53:52,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218667 conditions, 39018 events. 24008/39018 cut-off events. For 79669/85486 co-relation queries the response was YES. Maximal size of possible extension queue 3051. Compared 341719 event pairs, 270 based on Foata normal form. 3129/23968 useless extension candidates. Maximal degree in co-relation 218636. Up to 27595 conditions per place. [2022-12-13 11:53:52,203 INFO L137 encePairwiseOnDemand]: 23/47 looper letters, 50 selfloop transitions, 49 changer transitions 57/169 dead transitions. [2022-12-13 11:53:52,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 169 transitions, 1659 flow [2022-12-13 11:53:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:53:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:53:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2022-12-13 11:53:52,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.523936170212766 [2022-12-13 11:53:52,209 INFO L175 Difference]: Start difference. First operand has 80 places, 102 transitions, 909 flow. Second operand 8 states and 197 transitions. [2022-12-13 11:53:52,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 169 transitions, 1659 flow [2022-12-13 11:54:04,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 169 transitions, 1456 flow, removed 81 selfloop flow, removed 4 redundant places. [2022-12-13 11:54:04,136 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 647 flow [2022-12-13 11:54:04,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2022-12-13 11:54:04,137 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2022-12-13 11:54:04,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:54:04,138 INFO L89 Accepts]: Start accepts. Operand has 86 places, 80 transitions, 647 flow [2022-12-13 11:54:04,139 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:54:04,139 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:54:04,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 80 transitions, 647 flow [2022-12-13 11:54:04,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 647 flow [2022-12-13 11:54:04,220 INFO L130 PetriNetUnfolder]: 939/1802 cut-off events. [2022-12-13 11:54:04,220 INFO L131 PetriNetUnfolder]: For 2399/3804 co-relation queries the response was YES. [2022-12-13 11:54:04,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8403 conditions, 1802 events. 939/1802 cut-off events. For 2399/3804 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 11771 event pairs, 4 based on Foata normal form. 1/689 useless extension candidates. Maximal degree in co-relation 8373. Up to 973 conditions per place. [2022-12-13 11:54:04,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 80 transitions, 647 flow [2022-12-13 11:54:04,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 1166 [2022-12-13 11:54:04,581 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:54:04,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 445 [2022-12-13 11:54:04,582 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 642 flow [2022-12-13 11:54:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:04,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:54:04,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:54:04,582 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-13 11:54:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:54:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1332657838, now seen corresponding path program 1 times [2022-12-13 11:54:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:54:04,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859926049] [2022-12-13 11:54:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:54:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:54:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:54:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:54:04,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:54:04,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859926049] [2022-12-13 11:54:04,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859926049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:54:04,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:54:04,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:54:04,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065204660] [2022-12-13 11:54:04,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:54:04,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:54:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:54:04,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:54:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:54:04,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:54:04,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 642 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:04,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:54:04,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:54:04,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:54:05,167 INFO L130 PetriNetUnfolder]: 3671/5663 cut-off events. [2022-12-13 11:54:05,168 INFO L131 PetriNetUnfolder]: For 21671/22502 co-relation queries the response was YES. [2022-12-13 11:54:05,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28602 conditions, 5663 events. 3671/5663 cut-off events. For 21671/22502 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 33639 event pairs, 220 based on Foata normal form. 362/4408 useless extension candidates. Maximal degree in co-relation 28569. Up to 2581 conditions per place. [2022-12-13 11:54:05,200 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 85 selfloop transitions, 15 changer transitions 44/164 dead transitions. [2022-12-13 11:54:05,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 164 transitions, 1589 flow [2022-12-13 11:54:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:54:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:54:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2022-12-13 11:54:05,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2022-12-13 11:54:05,202 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 642 flow. Second operand 5 states and 117 transitions. [2022-12-13 11:54:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 164 transitions, 1589 flow [2022-12-13 11:54:05,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 164 transitions, 1196 flow, removed 91 selfloop flow, removed 13 redundant places. [2022-12-13 11:54:05,451 INFO L231 Difference]: Finished difference. Result has 73 places, 84 transitions, 559 flow [2022-12-13 11:54:05,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=73, PETRI_TRANSITIONS=84} [2022-12-13 11:54:05,453 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2022-12-13 11:54:05,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:54:05,453 INFO L89 Accepts]: Start accepts. Operand has 73 places, 84 transitions, 559 flow [2022-12-13 11:54:05,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:54:05,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:54:05,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 84 transitions, 559 flow [2022-12-13 11:54:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 84 transitions, 559 flow [2022-12-13 11:54:05,553 INFO L130 PetriNetUnfolder]: 1453/2416 cut-off events. [2022-12-13 11:54:05,553 INFO L131 PetriNetUnfolder]: For 3370/3847 co-relation queries the response was YES. [2022-12-13 11:54:05,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7188 conditions, 2416 events. 1453/2416 cut-off events. For 3370/3847 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 15123 event pairs, 1 based on Foata normal form. 12/787 useless extension candidates. Maximal degree in co-relation 7163. Up to 1135 conditions per place. [2022-12-13 11:54:05,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 84 transitions, 559 flow [2022-12-13 11:54:05,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 1202 [2022-12-13 11:54:05,576 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:54:05,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 11:54:05,577 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 84 transitions, 559 flow [2022-12-13 11:54:05,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:05,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:54:05,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:05,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:54:05,577 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-13 11:54:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:54:05,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1434059420, now seen corresponding path program 2 times [2022-12-13 11:54:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:54:05,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814325475] [2022-12-13 11:54:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:54:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:54:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:54:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:54:05,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:54:05,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814325475] [2022-12-13 11:54:05,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814325475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:54:05,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:54:05,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:54:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696434614] [2022-12-13 11:54:05,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:54:05,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:54:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:54:05,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:54:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:54:05,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:54:05,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 84 transitions, 559 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:05,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:54:05,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:54:05,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:54:06,249 INFO L130 PetriNetUnfolder]: 4483/6896 cut-off events. [2022-12-13 11:54:06,250 INFO L131 PetriNetUnfolder]: For 18275/18849 co-relation queries the response was YES. [2022-12-13 11:54:06,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27025 conditions, 6896 events. 4483/6896 cut-off events. For 18275/18849 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 41991 event pairs, 310 based on Foata normal form. 319/5151 useless extension candidates. Maximal degree in co-relation 26997. Up to 2778 conditions per place. [2022-12-13 11:54:06,278 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 67 selfloop transitions, 5 changer transitions 65/156 dead transitions. [2022-12-13 11:54:06,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 156 transitions, 1213 flow [2022-12-13 11:54:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:54:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:54:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-13 11:54:06,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 11:54:06,280 INFO L175 Difference]: Start difference. First operand has 73 places, 84 transitions, 559 flow. Second operand 6 states and 120 transitions. [2022-12-13 11:54:06,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 156 transitions, 1213 flow [2022-12-13 11:54:06,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 156 transitions, 1208 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 11:54:06,518 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 412 flow [2022-12-13 11:54:06,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2022-12-13 11:54:06,518 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, 0 predicate places. [2022-12-13 11:54:06,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:54:06,518 INFO L89 Accepts]: Start accepts. Operand has 78 places, 69 transitions, 412 flow [2022-12-13 11:54:06,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:54:06,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:54:06,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 69 transitions, 412 flow [2022-12-13 11:54:06,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 412 flow [2022-12-13 11:54:06,588 INFO L130 PetriNetUnfolder]: 684/1189 cut-off events. [2022-12-13 11:54:06,588 INFO L131 PetriNetUnfolder]: For 3663/3954 co-relation queries the response was YES. [2022-12-13 11:54:06,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3877 conditions, 1189 events. 684/1189 cut-off events. For 3663/3954 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 6975 event pairs, 0 based on Foata normal form. 8/427 useless extension candidates. Maximal degree in co-relation 3850. Up to 568 conditions per place. [2022-12-13 11:54:06,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 69 transitions, 412 flow [2022-12-13 11:54:06,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 11:54:06,600 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] $Ultimate##0-->L755: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~b~0_4 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~b~0=v_~b~0_4, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [372] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-13 11:54:06,616 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 11:54:07,141 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:54:07,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 624 [2022-12-13 11:54:07,142 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 394 flow [2022-12-13 11:54:07,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:07,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:54:07,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:07,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:54:07,142 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-13 11:54:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:54:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash 745697363, now seen corresponding path program 1 times [2022-12-13 11:54:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:54:07,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918312737] [2022-12-13 11:54:07,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:54:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:54:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:54:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:54:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:54:07,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918312737] [2022-12-13 11:54:07,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918312737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:54:07,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:54:07,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:54:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338255210] [2022-12-13 11:54:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:54:07,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:54:07,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:54:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:54:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:54:07,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 11:54:07,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:07,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:54:07,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 11:54:07,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:54:07,410 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 11:54:07,410 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 11:54:07,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 17 events. 0/17 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 11:54:07,410 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2022-12-13 11:54:07,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 17 transitions, 108 flow [2022-12-13 11:54:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:54:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:54:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 3 states and 37 transitions. [2022-12-13 11:54:07,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2022-12-13 11:54:07,411 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 394 flow. Second operand 3 states and 37 transitions. [2022-12-13 11:54:07,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 17 transitions, 108 flow [2022-12-13 11:54:07,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 17 transitions, 71 flow, removed 3 selfloop flow, removed 16 redundant places. [2022-12-13 11:54:07,412 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2022-12-13 11:54:07,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2022-12-13 11:54:07,413 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -42 predicate places. [2022-12-13 11:54:07,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:54:07,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 0 transitions, 0 flow [2022-12-13 11:54:07,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 11:54:07,413 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 11:54:07,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:54:07,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 11:54:07,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 11:54:07,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 11:54:07,414 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:54:07,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 11:54:07,414 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 11:54:07,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:54:07,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:54:07,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:54:07,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:54:07,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:54:07,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:54:07,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:54:07,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:54:07,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:54:07,418 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:54:07,422 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:54:07,422 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:54:07,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:54:07 BasicIcfg [2022-12-13 11:54:07,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:54:07,425 INFO L158 Benchmark]: Toolchain (without parser) took 79876.88ms. Allocated memory was 179.3MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 154.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-13 11:54:07,425 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:54:07,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.44ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 126.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 11:54:07,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.03ms. Allocated memory is still 179.3MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:54:07,425 INFO L158 Benchmark]: Boogie Preprocessor took 43.25ms. Allocated memory is still 179.3MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:54:07,425 INFO L158 Benchmark]: RCFGBuilder took 628.59ms. Allocated memory is still 179.3MB. Free memory was 122.7MB in the beginning and 91.8MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 11:54:07,425 INFO L158 Benchmark]: TraceAbstraction took 78845.01ms. Allocated memory was 179.3MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 90.7MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.5GB. Max. memory is 8.0GB. [2022-12-13 11:54:07,426 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.10ms. Allocated memory is still 179.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.44ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 126.9MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.03ms. Allocated memory is still 179.3MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.25ms. Allocated memory is still 179.3MB. Free memory was 124.8MB in the beginning and 122.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 628.59ms. Allocated memory is still 179.3MB. Free memory was 122.7MB in the beginning and 91.8MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 78845.01ms. Allocated memory was 179.3MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 90.7MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 3.5GB. 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, 78 PlacesAfterwards, 126 TransitionsBefore, 66 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 53 ConcurrentYvCompositions, 3 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4995, independent: 4856, independent conditional: 4856, independent unconditional: 0, dependent: 139, dependent conditional: 139, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4995, independent: 4856, independent conditional: 0, independent unconditional: 4856, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4995, independent: 4856, independent conditional: 0, independent unconditional: 4856, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4995, independent: 4856, independent conditional: 0, independent unconditional: 4856, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2727, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2727, independent: 2650, independent conditional: 0, independent unconditional: 2650, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 177, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4995, independent: 2187, independent conditional: 0, independent unconditional: 2187, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 2727, unknown conditional: 0, unknown unconditional: 2727] , Statistics on independence cache: Total cache size (in pairs): 5629, Positive cache size: 5571, Positive conditional cache size: 0, Positive unconditional cache size: 5571, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, 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.3s, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 448, independent conditional: 448, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 490, independent: 448, independent conditional: 20, independent unconditional: 428, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 448, independent conditional: 20, independent unconditional: 428, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 448, independent conditional: 20, independent unconditional: 428, dependent: 42, dependent conditional: 5, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 387, independent: 357, independent conditional: 20, independent unconditional: 337, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 387, independent: 276, independent conditional: 0, independent unconditional: 276, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 215, dependent conditional: 22, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 490, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 387, unknown conditional: 23, unknown unconditional: 364] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 357, Positive conditional cache size: 20, Positive unconditional cache size: 337, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, 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, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 359, independent: 328, independent conditional: 328, 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: 359, independent: 328, independent conditional: 18, independent unconditional: 310, 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: 359, independent: 328, independent conditional: 0, independent unconditional: 328, 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: 359, independent: 328, independent conditional: 0, independent unconditional: 328, 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: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 359, independent: 319, independent conditional: 0, independent unconditional: 319, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 366, Positive conditional cache size: 20, Positive unconditional cache size: 346, Negative cache size: 35, Negative conditional cache size: 3, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 1054 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 228, independent conditional: 45, independent unconditional: 183, dependent: 16, dependent conditional: 7, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 228, independent conditional: 0, independent unconditional: 228, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 228, independent conditional: 0, independent unconditional: 228, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 244, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 385, Positive conditional cache size: 20, Positive unconditional cache size: 365, Negative cache size: 36, Negative conditional cache size: 3, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 61 PlacesBefore, 60 PlacesAfterwards, 71 TransitionsBefore, 70 TransitionsAfterwards, 1752 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, independent: 910, independent conditional: 910, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 970, independent: 910, independent conditional: 466, independent unconditional: 444, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 970, independent: 910, independent conditional: 384, independent unconditional: 526, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 970, independent: 910, independent conditional: 384, independent unconditional: 526, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 51, independent: 49, independent conditional: 21, independent unconditional: 28, 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: 51, independent: 49, independent conditional: 0, independent unconditional: 49, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 970, independent: 861, independent conditional: 363, independent unconditional: 498, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 51, unknown conditional: 21, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 459, Positive conditional cache size: 41, Positive unconditional cache size: 418, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 82, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 67 PlacesBefore, 67 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 2492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 856, independent: 790, independent conditional: 790, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 856, independent: 790, independent conditional: 374, independent unconditional: 416, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 856, independent: 790, independent conditional: 310, independent unconditional: 480, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 856, independent: 790, independent conditional: 310, independent unconditional: 480, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 856, independent: 784, independent conditional: 304, independent unconditional: 480, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 465, Positive conditional cache size: 47, Positive unconditional cache size: 418, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 375, independent: 358, independent conditional: 358, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 375, independent: 358, independent conditional: 220, independent unconditional: 138, dependent: 17, dependent conditional: 13, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 375, independent: 358, independent conditional: 139, independent unconditional: 219, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 375, independent: 358, independent conditional: 139, independent unconditional: 219, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 375, independent: 358, independent conditional: 139, independent unconditional: 219, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 465, Positive conditional cache size: 47, Positive unconditional cache size: 418, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 94, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 69 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 2286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 358, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 358, independent: 341, independent conditional: 207, independent unconditional: 134, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 358, independent: 341, independent conditional: 126, independent unconditional: 215, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 358, independent: 341, independent conditional: 126, independent unconditional: 215, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 358, independent: 341, independent conditional: 126, independent unconditional: 215, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 465, Positive conditional cache size: 47, Positive unconditional cache size: 418, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 81, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 73 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, independent: 380, independent conditional: 380, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 399, independent: 380, independent conditional: 226, independent unconditional: 154, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 399, independent: 380, independent conditional: 147, independent unconditional: 233, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 399, independent: 380, independent conditional: 147, independent unconditional: 233, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 399, independent: 380, independent conditional: 147, independent unconditional: 233, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 465, Positive conditional cache size: 47, Positive unconditional cache size: 418, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 79, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 81 PlacesBefore, 80 PlacesAfterwards, 103 TransitionsBefore, 102 TransitionsAfterwards, 2506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1147, independent: 1087, independent conditional: 1087, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1147, independent: 1087, independent conditional: 715, independent unconditional: 372, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1147, independent: 1087, independent conditional: 459, independent unconditional: 628, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1147, independent: 1087, independent conditional: 459, independent unconditional: 628, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 1147, independent: 1079, independent conditional: 453, independent unconditional: 626, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 504, Positive conditional cache size: 59, Positive unconditional cache size: 445, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 256, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 81 PlacesBefore, 78 PlacesAfterwards, 80 TransitionsBefore, 77 TransitionsAfterwards, 1166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 532, independent: 496, independent conditional: 496, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 532, independent: 496, independent conditional: 326, independent unconditional: 170, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 532, independent: 496, independent conditional: 276, independent unconditional: 220, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 532, independent: 496, independent conditional: 276, independent unconditional: 220, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 2, independent unconditional: 10, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 532, independent: 484, independent conditional: 274, independent unconditional: 210, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 606, Positive cache size: 568, Positive conditional cache size: 61, Positive unconditional cache size: 507, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 354, independent: 335, independent conditional: 335, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 354, independent: 335, independent conditional: 263, independent unconditional: 72, dependent: 19, dependent conditional: 15, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 354, independent: 335, independent conditional: 247, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 354, independent: 335, independent conditional: 247, independent unconditional: 88, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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: 354, independent: 333, independent conditional: 247, independent unconditional: 86, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 570, Positive conditional cache size: 61, Positive unconditional cache size: 509, Negative cache size: 38, Negative conditional cache size: 3, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 76 PlacesBefore, 74 PlacesAfterwards, 69 TransitionsBefore, 66 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 497, independent: 447, independent conditional: 447, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 497, independent: 447, independent conditional: 437, independent unconditional: 10, dependent: 50, dependent conditional: 49, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 693, independent: 447, independent conditional: 90, independent unconditional: 357, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 693, independent: 447, independent conditional: 90, independent unconditional: 357, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 693, independent: 440, independent conditional: 90, independent unconditional: 350, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 610, Positive conditional cache size: 66, Positive unconditional cache size: 544, Negative cache size: 40, Negative conditional cache size: 3, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 592, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 610, Positive conditional cache size: 66, Positive unconditional cache size: 544, Negative cache size: 40, Negative conditional cache size: 3, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 78.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 49.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 583 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 25 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=909occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 11:54:07,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...