/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:34:38,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:34:38,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:34:38,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:34:38,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:34:38,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:34:38,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:34:38,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:34:38,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:34:38,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:34:38,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:34:38,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:34:38,735 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:34:38,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:34:38,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:34:38,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:34:38,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:34:38,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:34:38,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:34:38,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:34:38,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:34:38,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:34:38,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:34:38,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:34:38,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:34:38,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:34:38,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:34:38,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:34:38,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:34:38,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:34:38,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:34:38,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:34:38,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:34:38,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:34:38,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:34:38,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:34:38,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:34:38,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:34:38,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:34:38,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:34:38,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:34:38,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:34:38,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:34:38,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:34:38,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:34:38,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:34:38,782 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:34:38,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:34:38,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:34:38,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:34:38,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:34:38,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:34:38,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:34:38,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:34:38,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:34:38,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:34:38,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:34:38,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:34:38,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:34:38,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:34:38,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:34:38,790 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:34:38,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:34:38,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:34:38,790 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:34:38,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:34:39,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:34:39,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:34:39,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:34:39,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:34:39,125 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:34:39,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2022-12-13 09:34:40,228 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:34:40,507 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:34:40,508 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_rmo.oepc.i [2022-12-13 09:34:40,518 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71e62173/5093ff352b4948509550b016a85a93b3/FLAG25ece133b [2022-12-13 09:34:40,547 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e71e62173/5093ff352b4948509550b016a85a93b3 [2022-12-13 09:34:40,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:34:40,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:34:40,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:34:40,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:34:40,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:34:40,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:34:40" (1/1) ... [2022-12-13 09:34:40,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a45932f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:40, skipping insertion in model container [2022-12-13 09:34:40,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:34:40" (1/1) ... [2022-12-13 09:34:40,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:34:40,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:34:40,760 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/safe016_rmo.oepc.i[993,1006] [2022-12-13 09:34:40,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:40,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:34:40,979 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:34:40,987 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/safe016_rmo.oepc.i[993,1006] [2022-12-13 09:34:40,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:34:41,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:34:41,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:34:41,073 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:34:41,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41 WrapperNode [2022-12-13 09:34:41,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:34:41,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:34:41,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:34:41,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:34:41,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,120 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-12-13 09:34:41,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:34:41,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:34:41,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:34:41,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:34:41,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,142 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:34:41,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:34:41,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:34:41,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:34:41,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (1/1) ... [2022-12-13 09:34:41,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:34:41,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:34:41,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:34:41,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:34:41,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:34:41,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:34:41,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:34:41,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:34:41,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:34:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:34:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:34:41,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:34:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:34:41,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:34:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:34:41,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:34:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:34:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:34:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:34:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:34:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:34:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:34:41,248 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:34:41,408 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:34:41,409 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:34:41,781 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:34:42,001 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:34:42,001 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:34:42,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:34:42 BoogieIcfgContainer [2022-12-13 09:34:42,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:34:42,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:34:42,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:34:42,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:34:42,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:34:40" (1/3) ... [2022-12-13 09:34:42,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed82ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:34:42, skipping insertion in model container [2022-12-13 09:34:42,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:34:41" (2/3) ... [2022-12-13 09:34:42,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed82ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:34:42, skipping insertion in model container [2022-12-13 09:34:42,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:34:42" (3/3) ... [2022-12-13 09:34:42,011 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_rmo.oepc.i [2022-12-13 09:34:42,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:34:42,030 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 09:34:42,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:34:42,126 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:34:42,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2022-12-13 09:34:42,229 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2022-12-13 09:34:42,229 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:34:42,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 09:34:42,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2022-12-13 09:34:42,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2022-12-13 09:34:42,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:34:42,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-13 09:34:42,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2022-12-13 09:34:42,309 INFO L130 PetriNetUnfolder]: 1/124 cut-off events. [2022-12-13 09:34:42,309 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:34:42,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:34:42,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-13 09:34:42,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-13 09:34:52,040 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-13 09:34:52,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:34:52,055 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;@5df45dd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:34:52,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 09:34:52,073 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-13 09:34:52,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:34:52,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:34:52,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:34:52,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:34:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash 516841788, now seen corresponding path program 1 times [2022-12-13 09:34:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:52,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977103503] [2022-12-13 09:34:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:52,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977103503] [2022-12-13 09:34:52,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977103503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:52,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:34:52,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:34:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625433367] [2022-12-13 09:34:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 09:34:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 09:34:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 09:34:52,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 09:34:52,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:52,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:34:52,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 09:34:52,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:34:53,206 INFO L130 PetriNetUnfolder]: 4983/7049 cut-off events. [2022-12-13 09:34:53,207 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-13 09:34:53,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14041 conditions, 7049 events. 4983/7049 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 37574 event pairs, 4983 based on Foata normal form. 0/5462 useless extension candidates. Maximal degree in co-relation 14029. Up to 6785 conditions per place. [2022-12-13 09:34:53,249 INFO L137 encePairwiseOnDemand]: 35/36 looper letters, 25 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2022-12-13 09:34:53,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 132 flow [2022-12-13 09:34:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 09:34:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 09:34:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-12-13 09:34:53,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 09:34:53,259 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 46 transitions. [2022-12-13 09:34:53,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 132 flow [2022-12-13 09:34:53,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:34:53,264 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-12-13 09:34:53,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 09:34:53,268 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-13 09:34:53,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:34:53,268 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 78 flow [2022-12-13 09:34:53,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:34:53,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:34:53,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 78 flow [2022-12-13 09:34:53,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 78 flow [2022-12-13 09:34:53,276 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 09:34:53,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:34:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 09:34:53,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 78 flow [2022-12-13 09:34:53,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 09:34:53,549 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:34:53,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-13 09:34:53,551 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 78 flow [2022-12-13 09:34:53,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:53,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:34:53,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:34:53,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:34:53,552 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:34:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1531237524, now seen corresponding path program 1 times [2022-12-13 09:34:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740628788] [2022-12-13 09:34:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:53,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740628788] [2022-12-13 09:34:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740628788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:53,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:34:53,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:34:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566872232] [2022-12-13 09:34:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:53,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:34:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:34:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:34:53,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 09:34:53,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:53,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:34:53,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 09:34:53,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:34:54,684 INFO L130 PetriNetUnfolder]: 6161/8921 cut-off events. [2022-12-13 09:34:54,684 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:34:54,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17537 conditions, 8921 events. 6161/8921 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 49502 event pairs, 2378 based on Foata normal form. 50/7138 useless extension candidates. Maximal degree in co-relation 17529. Up to 7888 conditions per place. [2022-12-13 09:34:54,732 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-12-13 09:34:54,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 212 flow [2022-12-13 09:34:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:34:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 09:34:54,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2022-12-13 09:34:54,735 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 78 flow. Second operand 3 states and 73 transitions. [2022-12-13 09:34:54,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 212 flow [2022-12-13 09:34:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:34:54,737 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 97 flow [2022-12-13 09:34:54,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-13 09:34:54,738 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-13 09:34:54,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:34:54,738 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 97 flow [2022-12-13 09:34:54,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:34:54,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:34:54,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 97 flow [2022-12-13 09:34:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 97 flow [2022-12-13 09:34:54,744 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 09:34:54,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:34:54,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 47 events. 3/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 62. Up to 10 conditions per place. [2022-12-13 09:34:54,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 97 flow [2022-12-13 09:34:54,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-13 09:34:54,856 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:34:54,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 09:34:54,857 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 97 flow [2022-12-13 09:34:54,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:54,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:34:54,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:34:54,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:34:54,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:34:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -223724596, now seen corresponding path program 1 times [2022-12-13 09:34:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:54,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924596575] [2022-12-13 09:34:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:55,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924596575] [2022-12-13 09:34:55,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924596575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:55,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:34:55,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:34:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483196222] [2022-12-13 09:34:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:34:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:34:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:34:55,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 09:34:55,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:55,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:34:55,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 09:34:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:34:55,823 INFO L130 PetriNetUnfolder]: 5412/8173 cut-off events. [2022-12-13 09:34:55,823 INFO L131 PetriNetUnfolder]: For 827/828 co-relation queries the response was YES. [2022-12-13 09:34:55,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16883 conditions, 8173 events. 5412/8173 cut-off events. For 827/828 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 49014 event pairs, 923 based on Foata normal form. 90/6527 useless extension candidates. Maximal degree in co-relation 16872. Up to 6351 conditions per place. [2022-12-13 09:34:55,869 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-12-13 09:34:55,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 216 flow [2022-12-13 09:34:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:34:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 09:34:55,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:34:55,871 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 97 flow. Second operand 3 states and 70 transitions. [2022-12-13 09:34:55,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 216 flow [2022-12-13 09:34:55,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:34:55,872 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 102 flow [2022-12-13 09:34:55,872 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 09:34:55,873 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-13 09:34:55,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:34:55,873 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 102 flow [2022-12-13 09:34:55,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:34:55,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:34:55,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 102 flow [2022-12-13 09:34:55,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 102 flow [2022-12-13 09:34:55,881 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 09:34:55,882 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 09:34:55,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 47 events. 3/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2022-12-13 09:34:55,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 102 flow [2022-12-13 09:34:55,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 09:34:55,884 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:34:55,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 09:34:55,885 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 102 flow [2022-12-13 09:34:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:55,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:34:55,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:34:55,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:34:55,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:34:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:55,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1037136722, now seen corresponding path program 1 times [2022-12-13 09:34:55,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:55,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586961651] [2022-12-13 09:34:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:55,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:56,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:56,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586961651] [2022-12-13 09:34:56,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586961651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:56,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:34:56,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:34:56,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877475457] [2022-12-13 09:34:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:56,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:34:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:34:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:34:56,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 09:34:56,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 102 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 09:34:56,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:34:56,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 09:34:56,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:34:57,336 INFO L130 PetriNetUnfolder]: 6690/9653 cut-off events. [2022-12-13 09:34:57,336 INFO L131 PetriNetUnfolder]: For 1948/1948 co-relation queries the response was YES. [2022-12-13 09:34:57,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21083 conditions, 9653 events. 6690/9653 cut-off events. For 1948/1948 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 53740 event pairs, 1870 based on Foata normal form. 75/7775 useless extension candidates. Maximal degree in co-relation 21070. Up to 7424 conditions per place. [2022-12-13 09:34:57,396 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 45 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2022-12-13 09:34:57,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 247 flow [2022-12-13 09:34:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:34:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 09:34:57,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2022-12-13 09:34:57,398 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 102 flow. Second operand 3 states and 74 transitions. [2022-12-13 09:34:57,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 247 flow [2022-12-13 09:34:57,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:34:57,401 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 106 flow [2022-12-13 09:34:57,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 09:34:57,403 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-13 09:34:57,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:34:57,403 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 106 flow [2022-12-13 09:34:57,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:34:57,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:34:57,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 106 flow [2022-12-13 09:34:57,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 106 flow [2022-12-13 09:34:57,409 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 09:34:57,410 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 09:34:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 47 events. 3/47 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2022-12-13 09:34:57,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 106 flow [2022-12-13 09:34:57,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 09:34:57,471 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:34:57,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 09:34:57,472 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 106 flow [2022-12-13 09:34:57,472 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 09:34:57,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:34:57,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:34:57,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:34:57,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:34:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:57,473 INFO L85 PathProgramCache]: Analyzing trace with hash 442629010, now seen corresponding path program 1 times [2022-12-13 09:34:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:57,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919418791] [2022-12-13 09:34:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919418791] [2022-12-13 09:34:57,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919418791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:57,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:34:57,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:34:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178095210] [2022-12-13 09:34:57,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:57,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:34:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:34:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:34:57,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 09:34:57,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:57,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:34:57,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 09:34:57,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:34:58,461 INFO L130 PetriNetUnfolder]: 7788/11432 cut-off events. [2022-12-13 09:34:58,461 INFO L131 PetriNetUnfolder]: For 3250/3250 co-relation queries the response was YES. [2022-12-13 09:34:58,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25300 conditions, 11432 events. 7788/11432 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 68713 event pairs, 3939 based on Foata normal form. 240/8971 useless extension candidates. Maximal degree in co-relation 25286. Up to 6306 conditions per place. [2022-12-13 09:34:58,513 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-13 09:34:58,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 249 flow [2022-12-13 09:34:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:34:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:34:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 09:34:58,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 09:34:58,515 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 106 flow. Second operand 3 states and 75 transitions. [2022-12-13 09:34:58,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 249 flow [2022-12-13 09:34:58,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:34:58,517 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2022-12-13 09:34:58,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-13 09:34:58,518 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2022-12-13 09:34:58,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:34:58,518 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 113 flow [2022-12-13 09:34:58,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:34:58,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:34:58,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 113 flow [2022-12-13 09:34:58,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 113 flow [2022-12-13 09:34:58,525 INFO L130 PetriNetUnfolder]: 0/48 cut-off events. [2022-12-13 09:34:58,526 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-12-13 09:34:58,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 48 events. 0/48 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 141 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 09:34:58,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 113 flow [2022-12-13 09:34:58,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-13 09:34:58,528 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:34:58,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 09:34:58,529 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2022-12-13 09:34:58,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:58,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:34:58,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:34:58,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:34:58,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:34:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:34:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2034494218, now seen corresponding path program 1 times [2022-12-13 09:34:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:34:58,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814607633] [2022-12-13 09:34:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:34:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:34:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:34:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:34:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:34:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814607633] [2022-12-13 09:34:59,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814607633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:34:59,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:34:59,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:34:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603026992] [2022-12-13 09:34:59,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:34:59,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:34:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:34:59,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:34:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:34:59,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 09:34:59,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:34:59,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:34:59,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 09:34:59,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:00,536 INFO L130 PetriNetUnfolder]: 8146/12000 cut-off events. [2022-12-13 09:35:00,536 INFO L131 PetriNetUnfolder]: For 4857/4958 co-relation queries the response was YES. [2022-12-13 09:35:00,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26844 conditions, 12000 events. 8146/12000 cut-off events. For 4857/4958 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 72409 event pairs, 2038 based on Foata normal form. 37/9232 useless extension candidates. Maximal degree in co-relation 26830. Up to 10353 conditions per place. [2022-12-13 09:35:00,579 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 38 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2022-12-13 09:35:00,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 234 flow [2022-12-13 09:35:00,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:35:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:35:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 09:35:00,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-13 09:35:00,580 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 3 states and 67 transitions. [2022-12-13 09:35:00,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 234 flow [2022-12-13 09:35:00,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 226 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 09:35:00,583 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 127 flow [2022-12-13 09:35:00,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-12-13 09:35:00,584 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2022-12-13 09:35:00,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:00,584 INFO L89 Accepts]: Start accepts. Operand has 53 places, 39 transitions, 127 flow [2022-12-13 09:35:00,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:00,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:00,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 39 transitions, 127 flow [2022-12-13 09:35:00,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 39 transitions, 127 flow [2022-12-13 09:35:00,592 INFO L130 PetriNetUnfolder]: 5/74 cut-off events. [2022-12-13 09:35:00,592 INFO L131 PetriNetUnfolder]: For 89/101 co-relation queries the response was YES. [2022-12-13 09:35:00,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 74 events. 5/74 cut-off events. For 89/101 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 263 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 130. Up to 15 conditions per place. [2022-12-13 09:35:00,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 39 transitions, 127 flow [2022-12-13 09:35:00,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-13 09:35:00,622 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:00,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 09:35:00,623 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 127 flow [2022-12-13 09:35:00,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:00,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:00,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:00,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:35:00,623 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1355185617, now seen corresponding path program 1 times [2022-12-13 09:35:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:00,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221855305] [2022-12-13 09:35:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:00,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221855305] [2022-12-13 09:35:00,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221855305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:00,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:00,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:35:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604592500] [2022-12-13 09:35:00,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:00,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:35:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:00,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:35:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:35:00,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 09:35:00,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:00,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:00,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 09:35:00,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:01,927 INFO L130 PetriNetUnfolder]: 9514/13772 cut-off events. [2022-12-13 09:35:01,927 INFO L131 PetriNetUnfolder]: For 6660/6777 co-relation queries the response was YES. [2022-12-13 09:35:01,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31718 conditions, 13772 events. 9514/13772 cut-off events. For 6660/6777 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 82251 event pairs, 7242 based on Foata normal form. 89/10678 useless extension candidates. Maximal degree in co-relation 31702. Up to 11558 conditions per place. [2022-12-13 09:35:01,984 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 36 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2022-12-13 09:35:01,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 258 flow [2022-12-13 09:35:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 09:35:01,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2022-12-13 09:35:01,986 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 127 flow. Second operand 4 states and 78 transitions. [2022-12-13 09:35:01,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 258 flow [2022-12-13 09:35:01,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:35:01,993 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 179 flow [2022-12-13 09:35:01,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 09:35:01,993 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2022-12-13 09:35:01,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:01,994 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 179 flow [2022-12-13 09:35:01,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:01,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:01,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 179 flow [2022-12-13 09:35:01,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 179 flow [2022-12-13 09:35:02,027 INFO L130 PetriNetUnfolder]: 95/332 cut-off events. [2022-12-13 09:35:02,028 INFO L131 PetriNetUnfolder]: For 341/371 co-relation queries the response was YES. [2022-12-13 09:35:02,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 332 events. 95/332 cut-off events. For 341/371 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1998 event pairs, 43 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 731. Up to 148 conditions per place. [2022-12-13 09:35:02,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 179 flow [2022-12-13 09:35:02,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 956 [2022-12-13 09:35:02,034 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:02,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 09:35:02,034 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 179 flow [2022-12-13 09:35:02,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:02,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:02,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:02,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:35:02,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1355098197, now seen corresponding path program 2 times [2022-12-13 09:35:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947149706] [2022-12-13 09:35:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:02,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:02,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947149706] [2022-12-13 09:35:02,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947149706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:02,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:02,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:35:02,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135926929] [2022-12-13 09:35:02,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:02,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:35:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:02,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:35:02,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:35:02,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 09:35:02,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:02,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:02,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 09:35:02,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:04,095 INFO L130 PetriNetUnfolder]: 14197/20971 cut-off events. [2022-12-13 09:35:04,095 INFO L131 PetriNetUnfolder]: For 16496/16632 co-relation queries the response was YES. [2022-12-13 09:35:04,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53526 conditions, 20971 events. 14197/20971 cut-off events. For 16496/16632 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 141002 event pairs, 6144 based on Foata normal form. 274/16148 useless extension candidates. Maximal degree in co-relation 53508. Up to 10850 conditions per place. [2022-12-13 09:35:04,215 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 51 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2022-12-13 09:35:04,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 388 flow [2022-12-13 09:35:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:35:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:35:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 09:35:04,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2022-12-13 09:35:04,216 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 179 flow. Second operand 5 states and 104 transitions. [2022-12-13 09:35:04,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 388 flow [2022-12-13 09:35:04,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:35:04,226 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 215 flow [2022-12-13 09:35:04,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-12-13 09:35:04,227 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2022-12-13 09:35:04,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:04,227 INFO L89 Accepts]: Start accepts. Operand has 59 places, 47 transitions, 215 flow [2022-12-13 09:35:04,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:04,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:04,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 215 flow [2022-12-13 09:35:04,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 215 flow [2022-12-13 09:35:04,286 INFO L130 PetriNetUnfolder]: 115/512 cut-off events. [2022-12-13 09:35:04,286 INFO L131 PetriNetUnfolder]: For 499/525 co-relation queries the response was YES. [2022-12-13 09:35:04,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 512 events. 115/512 cut-off events. For 499/525 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3895 event pairs, 59 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 1084. Up to 196 conditions per place. [2022-12-13 09:35:04,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 47 transitions, 215 flow [2022-12-13 09:35:04,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-13 09:35:04,294 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:04,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 09:35:04,294 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 215 flow [2022-12-13 09:35:04,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:04,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:04,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:04,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:35:04,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1989133150, now seen corresponding path program 1 times [2022-12-13 09:35:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850161108] [2022-12-13 09:35:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:04,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850161108] [2022-12-13 09:35:04,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850161108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:04,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:04,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:35:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998641735] [2022-12-13 09:35:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:04,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:35:04,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:35:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:35:04,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 09:35:04,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:04,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:04,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 09:35:04,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:08,567 INFO L130 PetriNetUnfolder]: 37896/52677 cut-off events. [2022-12-13 09:35:08,567 INFO L131 PetriNetUnfolder]: For 40530/41594 co-relation queries the response was YES. [2022-12-13 09:35:08,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136022 conditions, 52677 events. 37896/52677 cut-off events. For 40530/41594 co-relation queries the response was YES. Maximal size of possible extension queue 3186. Compared 364294 event pairs, 3987 based on Foata normal form. 4096/35230 useless extension candidates. Maximal degree in co-relation 136003. Up to 29800 conditions per place. [2022-12-13 09:35:08,808 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 81 selfloop transitions, 14 changer transitions 3/106 dead transitions. [2022-12-13 09:35:08,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 645 flow [2022-12-13 09:35:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:35:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:35:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 09:35:08,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 09:35:08,810 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 215 flow. Second operand 4 states and 98 transitions. [2022-12-13 09:35:08,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 645 flow [2022-12-13 09:35:08,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 613 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:35:08,846 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 309 flow [2022-12-13 09:35:08,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-13 09:35:08,846 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2022-12-13 09:35:08,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:08,846 INFO L89 Accepts]: Start accepts. Operand has 61 places, 59 transitions, 309 flow [2022-12-13 09:35:08,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:08,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:08,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 59 transitions, 309 flow [2022-12-13 09:35:08,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 309 flow [2022-12-13 09:35:10,338 INFO L130 PetriNetUnfolder]: 11254/16790 cut-off events. [2022-12-13 09:35:10,338 INFO L131 PetriNetUnfolder]: For 12235/16936 co-relation queries the response was YES. [2022-12-13 09:35:10,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41220 conditions, 16790 events. 11254/16790 cut-off events. For 12235/16936 co-relation queries the response was YES. Maximal size of possible extension queue 2313. Compared 133080 event pairs, 6876 based on Foata normal form. 15/6635 useless extension candidates. Maximal degree in co-relation 41201. Up to 15175 conditions per place. [2022-12-13 09:35:10,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 309 flow [2022-12-13 09:35:10,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 1282 [2022-12-13 09:35:10,506 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:10,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1661 [2022-12-13 09:35:10,507 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 309 flow [2022-12-13 09:35:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:10,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:10,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:35:10,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -963209220, now seen corresponding path program 1 times [2022-12-13 09:35:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440146510] [2022-12-13 09:35:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:10,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440146510] [2022-12-13 09:35:10,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440146510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:10,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:10,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:35:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168969653] [2022-12-13 09:35:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:10,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:35:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:10,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:35:10,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:35:10,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 09:35:10,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:10,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:10,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 09:35:10,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:13,860 INFO L130 PetriNetUnfolder]: 29602/42645 cut-off events. [2022-12-13 09:35:13,861 INFO L131 PetriNetUnfolder]: For 43772/44698 co-relation queries the response was YES. [2022-12-13 09:35:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146289 conditions, 42645 events. 29602/42645 cut-off events. For 43772/44698 co-relation queries the response was YES. Maximal size of possible extension queue 2853. Compared 308608 event pairs, 921 based on Foata normal form. 3879/29506 useless extension candidates. Maximal degree in co-relation 146267. Up to 27940 conditions per place. [2022-12-13 09:35:14,106 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 97 selfloop transitions, 26 changer transitions 6/137 dead transitions. [2022-12-13 09:35:14,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 137 transitions, 929 flow [2022-12-13 09:35:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:35:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:35:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2022-12-13 09:35:14,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-12-13 09:35:14,108 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 309 flow. Second operand 5 states and 126 transitions. [2022-12-13 09:35:14,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 137 transitions, 929 flow [2022-12-13 09:35:14,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 137 transitions, 908 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 09:35:14,182 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 459 flow [2022-12-13 09:35:14,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2022-12-13 09:35:14,183 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-13 09:35:14,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:14,183 INFO L89 Accepts]: Start accepts. Operand has 65 places, 71 transitions, 459 flow [2022-12-13 09:35:14,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:14,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:14,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 71 transitions, 459 flow [2022-12-13 09:35:14,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 71 transitions, 459 flow [2022-12-13 09:35:15,479 INFO L130 PetriNetUnfolder]: 8449/13895 cut-off events. [2022-12-13 09:35:15,479 INFO L131 PetriNetUnfolder]: For 14626/23671 co-relation queries the response was YES. [2022-12-13 09:35:15,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48410 conditions, 13895 events. 8449/13895 cut-off events. For 14626/23671 co-relation queries the response was YES. Maximal size of possible extension queue 2080. Compared 119823 event pairs, 2877 based on Foata normal form. 49/6562 useless extension candidates. Maximal degree in co-relation 48389. Up to 11623 conditions per place. [2022-12-13 09:35:15,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 71 transitions, 459 flow [2022-12-13 09:35:15,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-13 09:35:15,937 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:35:15,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1754 [2022-12-13 09:35:15,937 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 459 flow [2022-12-13 09:35:15,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:15,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:15,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:15,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:35:15,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -547616863, now seen corresponding path program 1 times [2022-12-13 09:35:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:15,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128156841] [2022-12-13 09:35:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:16,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128156841] [2022-12-13 09:35:16,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128156841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:16,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:16,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:35:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001306841] [2022-12-13 09:35:16,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:16,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:35:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:35:16,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:35:16,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 09:35:16,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:16,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:16,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 09:35:16,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:18,185 INFO L130 PetriNetUnfolder]: 17587/27027 cut-off events. [2022-12-13 09:35:18,186 INFO L131 PetriNetUnfolder]: For 40974/41639 co-relation queries the response was YES. [2022-12-13 09:35:18,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112880 conditions, 27027 events. 17587/27027 cut-off events. For 40974/41639 co-relation queries the response was YES. Maximal size of possible extension queue 1917. Compared 205984 event pairs, 165 based on Foata normal form. 3071/19608 useless extension candidates. Maximal degree in co-relation 112856. Up to 16978 conditions per place. [2022-12-13 09:35:18,371 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 101 selfloop transitions, 38 changer transitions 7/154 dead transitions. [2022-12-13 09:35:18,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 154 transitions, 1189 flow [2022-12-13 09:35:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:35:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:35:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2022-12-13 09:35:18,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2022-12-13 09:35:18,372 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 459 flow. Second operand 6 states and 152 transitions. [2022-12-13 09:35:18,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 154 transitions, 1189 flow [2022-12-13 09:35:18,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 154 transitions, 1117 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 09:35:18,708 INFO L231 Difference]: Finished difference. Result has 68 places, 81 transitions, 587 flow [2022-12-13 09:35:18,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=68, PETRI_TRANSITIONS=81} [2022-12-13 09:35:18,709 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2022-12-13 09:35:18,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:18,709 INFO L89 Accepts]: Start accepts. Operand has 68 places, 81 transitions, 587 flow [2022-12-13 09:35:18,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:18,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:18,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 81 transitions, 587 flow [2022-12-13 09:35:18,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 81 transitions, 587 flow [2022-12-13 09:35:19,473 INFO L130 PetriNetUnfolder]: 4747/8947 cut-off events. [2022-12-13 09:35:19,473 INFO L131 PetriNetUnfolder]: For 19095/23883 co-relation queries the response was YES. [2022-12-13 09:35:19,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39613 conditions, 8947 events. 4747/8947 cut-off events. For 19095/23883 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 83468 event pairs, 636 based on Foata normal form. 35/4487 useless extension candidates. Maximal degree in co-relation 39591. Up to 7111 conditions per place. [2022-12-13 09:35:19,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 81 transitions, 587 flow [2022-12-13 09:35:19,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 1500 [2022-12-13 09:35:21,065 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:35:21,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2357 [2022-12-13 09:35:21,066 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 81 transitions, 587 flow [2022-12-13 09:35:21,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:35:21,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:21,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:21,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:35:21,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1011474030, now seen corresponding path program 1 times [2022-12-13 09:35:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:21,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567205737] [2022-12-13 09:35:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:35:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:35:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:35:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567205737] [2022-12-13 09:35:21,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567205737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:35:21,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:35:21,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:35:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414264058] [2022-12-13 09:35:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:35:21,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:35:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:35:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:35:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:35:21,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 09:35:21,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 81 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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 09:35:21,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:35:21,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 09:35:21,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:35:22,756 INFO L130 PetriNetUnfolder]: 10205/16081 cut-off events. [2022-12-13 09:35:22,756 INFO L131 PetriNetUnfolder]: For 27801/28283 co-relation queries the response was YES. [2022-12-13 09:35:22,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76625 conditions, 16081 events. 10205/16081 cut-off events. For 27801/28283 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 118723 event pairs, 164 based on Foata normal form. 1671/11283 useless extension candidates. Maximal degree in co-relation 76600. Up to 9181 conditions per place. [2022-12-13 09:35:22,824 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 60 selfloop transitions, 50 changer transitions 14/130 dead transitions. [2022-12-13 09:35:22,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 130 transitions, 1071 flow [2022-12-13 09:35:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:35:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:35:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2022-12-13 09:35:22,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 09:35:22,826 INFO L175 Difference]: Start difference. First operand has 68 places, 81 transitions, 587 flow. Second operand 7 states and 144 transitions. [2022-12-13 09:35:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 130 transitions, 1071 flow [2022-12-13 09:35:23,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 130 transitions, 930 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-13 09:35:23,570 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 578 flow [2022-12-13 09:35:23,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2022-12-13 09:35:23,570 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2022-12-13 09:35:23,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:35:23,570 INFO L89 Accepts]: Start accepts. Operand has 69 places, 77 transitions, 578 flow [2022-12-13 09:35:23,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:35:23,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:35:23,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 77 transitions, 578 flow [2022-12-13 09:35:23,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 77 transitions, 578 flow [2022-12-13 09:35:23,661 INFO L130 PetriNetUnfolder]: 743/1499 cut-off events. [2022-12-13 09:35:23,661 INFO L131 PetriNetUnfolder]: For 2376/2667 co-relation queries the response was YES. [2022-12-13 09:35:23,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6615 conditions, 1499 events. 743/1499 cut-off events. For 2376/2667 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 10252 event pairs, 9 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 6594. Up to 892 conditions per place. [2022-12-13 09:35:23,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 77 transitions, 578 flow [2022-12-13 09:35:23,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-13 09:35:26,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] L783-->L788: 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] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_195 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 09:35:26,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L783-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P0Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_195 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 09:35:26,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L783-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.base_17| 0) (= v_~__unbuffered_cnt~0_189 (+ v_~__unbuffered_cnt~0_190 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_17|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_190} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_17|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_189} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_195 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 09:35:26,889 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L795-->L800: 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] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_195 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 09:35:26,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_29| 0) (= v_~__unbuffered_cnt~0_241 (+ v_~__unbuffered_cnt~0_242 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_241, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_195 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 09:35:26,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L795-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [738] L858-3-->L861: Formula: (= (ite (= (ite (= v_~__unbuffered_cnt~0_195 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_38) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195} OutVars{ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre23#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet24#1] [2022-12-13 09:35:26,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L807-->L809: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [714] $Ultimate##0-->L826: Formula: (and (= |v_P3Thread1of1ForFork1_#in~arg.offset_5| v_P3Thread1of1ForFork1_~arg.offset_5) (= (store |v_#memory_int_373| |v_~#y~0.base_196| (store (select |v_#memory_int_373| |v_~#y~0.base_196|) |v_~#y~0.offset_196| 2)) |v_#memory_int_372|) (= v_P3Thread1of1ForFork1_~arg.base_5 |v_P3Thread1of1ForFork1_#in~arg.base_5|)) InVars {~#y~0.offset=|v_~#y~0.offset_196|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, #memory_int=|v_#memory_int_373|, ~#y~0.base=|v_~#y~0.base_196|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_196|, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_5|, #memory_int=|v_#memory_int_372|, ~#y~0.base=|v_~#y~0.base_196|, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_5, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_5|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[#memory_int, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] [2022-12-13 09:35:27,292 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L807-->L809: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [741] L856-3-->L858-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2164~0#1.base_14| 0)) (= |v_ULTIMATE.start_main_~#t2164~0#1.offset_14| 0) (= |v_#length_92| (store |v_#length_93| |v_ULTIMATE.start_main_~#t2164~0#1.base_14| 4)) (= (+ |v_#pthreadsForks_70| 1) |v_#pthreadsForks_69|) (= (select |v_#valid_102| |v_ULTIMATE.start_main_~#t2164~0#1.base_14|) 0) (= |v_#pthreadsForks_70| |v_ULTIMATE.start_main_#t~pre23#1_19|) (= (store |v_#memory_int_421| |v_ULTIMATE.start_main_~#t2164~0#1.base_14| (store (select |v_#memory_int_421| |v_ULTIMATE.start_main_~#t2164~0#1.base_14|) |v_ULTIMATE.start_main_~#t2164~0#1.offset_14| |v_ULTIMATE.start_main_#t~pre23#1_19|)) |v_#memory_int_420|) (= (store |v_#valid_102| |v_ULTIMATE.start_main_~#t2164~0#1.base_14| 1) |v_#valid_101|) (< |v_#StackHeapBarrier_50| |v_ULTIMATE.start_main_~#t2164~0#1.base_14|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_50|, #pthreadsForks=|v_#pthreadsForks_70|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_421|, #length=|v_#length_93|} OutVars{ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_7|, #StackHeapBarrier=|v_#StackHeapBarrier_50|, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_19|, ULTIMATE.start_main_~#t2164~0#1.offset=|v_ULTIMATE.start_main_~#t2164~0#1.offset_14|, #pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t2164~0#1.base=|v_ULTIMATE.start_main_~#t2164~0#1.base_14|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_420|, #length=|v_#length_92|, ULTIMATE.start_main_#t~pre21#1=|v_ULTIMATE.start_main_#t~pre21#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22#1, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_~#t2164~0#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t2164~0#1.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~pre21#1] [2022-12-13 09:35:27,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [625] L807-->L809: Formula: (= |v_#memory_int_12| (store |v_#memory_int_13| |v_~#y~0.base_10| (store (select |v_#memory_int_13| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_13|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [690] $Ultimate##0-->L780: Formula: (let ((.cse10 (= (mod v_~y$w_buff1_used~0_246 256) 0)) (.cse6 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_246 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd1~0_75 256) 0))) (let ((.cse13 (= (mod v_~weak$$choice2~0_106 256) 0)) (.cse15 (select |v_#memory_int_305| |v_~#y~0.base_178|)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse1 (and .cse6 .cse3)) (.cse14 (and .cse3 .cse10))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_245 256) 0)) (.cse8 (or .cse16 .cse1 .cse14)) (.cse12 (and .cse5 .cse11)) (.cse9 (select .cse15 |v_~#y~0.offset_178|)) (.cse0 (not .cse13)) (.cse4 (= (mod v_~y$w_buff0_used~0_245 256) 0))) (and (= v_~y$w_buff1~0_148 v_~y$w_buff1~0_147) (= v_~y$r_buff0_thd1~0_74 (ite .cse0 v_~y$r_buff0_thd1~0_75 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd1~0_75 (ite (and (not .cse4) .cse5) 0 v_~y$r_buff0_thd1~0_75)))) (= 0 v_~y$flush_delayed~0_82) (= (ite .cse0 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd1~0_74 256) 0))) (or (and .cse6 .cse7) (and .cse2 .cse7) .cse4)) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~__unbuffered_p0_EAX$read_delayed~0_52 1) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57 |v_~#y~0.offset_178|) (or (and (= v_~__unbuffered_p0_EAX~0_80 |v_P0_#t~mem6_54|) .cse8 (= |v_P0_#t~mem6_54| .cse9)) (and (or .cse5 (not .cse10)) .cse11 (= |v_P0Thread1of1ForFork0_#t~mem6_22| |v_P0_#t~mem6_54|) (or (not .cse6) .cse5) (= (ite .cse12 v_~y$w_buff0~0_130 v_~y$w_buff1~0_148) v_~__unbuffered_p0_EAX~0_80))) (= (ite .cse0 v_~y$w_buff0_used~0_246 (ite .cse8 v_~y$w_buff0_used~0_246 (ite .cse12 0 v_~y$w_buff0_used~0_246))) v_~y$w_buff0_used~0_245) (or (and .cse13 (= |v_P0_#t~ite10_35| |v_P0_#t~mem9_34|) (= v_~__unbuffered_p0_EAX~0_80 |v_P0_#t~mem9_34|)) (and (= |v_P0Thread1of1ForFork0_#t~mem9_22| |v_P0_#t~mem9_34|) (= |v_P0_#t~ite10_35| v_~y$mem_tmp~0_56) .cse0)) (= |v_~#y~0.base_178| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57) (= |v_P0Thread1of1ForFork0_#t~nondet3_22| v_~weak$$choice0~0_52) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$mem_tmp~0_56 .cse9) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= |v_P0Thread1of1ForFork0_#t~nondet4_22| v_~weak$$choice2~0_106) (= v_~y$w_buff1_used~0_245 (ite .cse0 v_~y$w_buff1_used~0_246 (ite (or .cse1 .cse14 .cse4) v_~y$w_buff1_used~0_246 0))) (= v_~y$w_buff0~0_129 v_~y$w_buff0~0_130) (= |v_#memory_int_304| (store |v_#memory_int_305| |v_~#y~0.base_178| (store .cse15 |v_~#y~0.offset_178| |v_P0_#t~ite10_35|))))))) InVars {~#y~0.offset=|v_~#y~0.offset_178|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_246, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~#y~0.base=|v_~#y~0.base_178|, P0Thread1of1ForFork0_#t~mem9=|v_P0Thread1of1ForFork0_#t~mem9_22|, P0Thread1of1ForFork0_#t~mem6=|v_P0Thread1of1ForFork0_#t~mem6_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff1~0=v_~y$w_buff1~0_148, ~y$w_buff0~0=v_~y$w_buff0~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_75, #memory_int=|v_#memory_int_305|, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_22|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_246} OutVars{P0Thread1of1ForFork0_#t~ite10=|v_P0Thread1of1ForFork0_#t~ite10_13|, ~#y~0.offset=|v_~#y~0.offset_178|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_245, ~#y~0.base=|v_~#y~0.base_178|, P0Thread1of1ForFork0_#t~mem8=|v_P0Thread1of1ForFork0_#t~mem8_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_#t~mem5=|v_P0Thread1of1ForFork0_#t~mem5_13|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0~0=v_~y$w_buff0~0_129, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_74, ~y$flush_delayed~0=v_~y$flush_delayed~0_82, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_52, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_57, ~weak$$choice0~0=v_~weak$$choice0~0_52, ~y$w_buff1~0=v_~y$w_buff1~0_147, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_13|, #memory_int=|v_#memory_int_304|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_57, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_245} AuxVars[|v_P0_#t~ite10_35|, |v_P0_#t~mem6_54|, |v_P0_#t~mem9_34|] AssignedVars[P0Thread1of1ForFork0_#t~ite10, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#t~mem8, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_#t~mem9, P0Thread1of1ForFork0_#t~mem6, P0Thread1of1ForFork0_#t~mem5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork0_~arg.offset, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork0_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 09:35:31,055 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [709] L783-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P0Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:32,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L783-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.base_17| 0) (= v_~__unbuffered_cnt~0_189 (+ v_~__unbuffered_cnt~0_190 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_17|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_190} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_17|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_189} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:33,734 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [681] L834-->P3FINAL: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:35,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] L834-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.base_23| 0) (= v_~__unbuffered_cnt~0_161 (+ v_~__unbuffered_cnt~0_162 1)) (= |v_P3Thread1of1ForFork1_#res.offset_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_161, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_23|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:36,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [633] L834-->L837: 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] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:37,676 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [750] L817-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_297 (+ v_~__unbuffered_cnt~0_298 1)) (= |v_P2Thread1of1ForFork3_#res.base_9| 0) (= |v_P2Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_298} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_9|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:38,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [749] L817-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork3_#res.base_7| 0) (= v_~__unbuffered_cnt~0_293 (+ v_~__unbuffered_cnt~0_294 1)) (= |v_P2Thread1of1ForFork3_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_294} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_293, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_7|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:40,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [627] L817-->L820: 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] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:41,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [620] L795-->L800: 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] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:42,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_29| 0) (= v_~__unbuffered_cnt~0_241 (+ v_~__unbuffered_cnt~0_242 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_29|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_241, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:43,872 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [644] L795-->P1FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork2_#res.base_5| 0) (= |v_P1Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:45,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [615] L783-->L788: 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] and [764] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_310 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_553 256) 0))) (let ((.cse27 (not .cse26)) (.cse28 (not .cse25))) (let ((.cse17 (ite (and .cse27 .cse28) 0 v_~y$w_buff0_used~0_553))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse30 (not .cse18))) (let ((.cse31 (and .cse28 .cse30))) (let ((.cse8 (ite .cse31 0 v_~y$r_buff0_thd0~0_310)) (.cse23 (= (mod v_~y$w_buff1_used~0_548 256) 0)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_307 256) 0))) (let ((.cse21 (not .cse24)) (.cse22 (not .cse23)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse12 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_548))) (let ((.cse29 (= (mod .cse12 256) 0)) (.cse19 (and .cse11 .cse30))) (let ((.cse3 (ite (or (and (not .cse29) .cse21) .cse19) 0 v_~y$r_buff1_thd0~0_307))) (let ((.cse4 (= (mod .cse3 256) 0)) (.cse1 (= (mod v_~weak$$choice2~0_183 256) 0))) (let ((.cse7 (= (mod v_~y$w_buff1_used~0_547 256) 0)) (.cse6 (= (mod v_~y$w_buff0_used~0_552 256) 0)) (.cse2 (not .cse1)) (.cse9 (and .cse10 .cse4)) (.cse13 (and .cse10 .cse29)) (.cse0 (select |v_#memory_int_739| |v_~#y~0.base_325|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_105) (= 2 v_~__unbuffered_p0_EAX~0_216) |v_ULTIMATE.start_main_#t~short38#1_254|)) 1 0) 0) 0 1)) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_350) (= v_~y$flush_delayed~0_163 0) (= v_~weak$$choice1~0_91 |v_ULTIMATE.start_main_#t~nondet33#1_145|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55| (mod v_~main$tmp_guard1~0_82 256)) (= |v_#memory_int_738| (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_198| |v_ULTIMATE.start_main_#t~ite40#1_154|) .cse1 (= |v_ULTIMATE.start_main_#t~mem39#1_198| 2)) (and .cse2 (= |v_ULTIMATE.start_main_#t~mem39#1_200| |v_ULTIMATE.start_main_#t~mem39#1_198|) (= v_~y$mem_tmp~0_141 |v_ULTIMATE.start_main_#t~ite40#1_154|))) (= |v_ULTIMATE.start_main_#t~nondet28#1_143| v_~weak$$choice0~0_133) (= v_~y$r_buff1_thd0~0_306 (ite .cse2 .cse3 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd0~0_309 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse5 .cse7))) .cse3 0))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_83| 0)) (= v_~y$r_buff0_thd0~0_309 (ite .cse2 .cse8 (ite (or .cse6 .cse9 (and .cse10 .cse7)) .cse8 (ite (and .cse11 (not .cse6)) 0 .cse8)))) (= v_~y$w_buff1_used~0_547 (ite .cse2 .cse12 (ite (or .cse6 .cse9 .cse13) .cse12 0))) (let ((.cse14 (= 0 (mod v_~__unbuffered_p0_EAX$read_delayed~0_144 256))) (.cse15 (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~mem34#1_230|))) (or (and .cse14 .cse15 (= |v_ULTIMATE.start_main_#t~ite35#1_227| |v_ULTIMATE.start_main_#t~ite35#1_225|) (= v_~__unbuffered_p0_EAX~0_217 v_~__unbuffered_p0_EAX~0_216)) (and (not .cse14) (let ((.cse16 (= (mod v_~weak$$choice1~0_91 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem34#1_228| |v_ULTIMATE.start_main_#t~ite35#1_225|) (not .cse16) (= |v_ULTIMATE.start_main_#t~mem34#1_228| (select (select (store |v_#memory_int_739| |v_~#y~0.base_325| (store .cse0 |v_~#y~0.offset_325| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_217) .cse15 .cse16))) (= |v_ULTIMATE.start_main_#t~ite35#1_225| v_~__unbuffered_p0_EAX~0_216)))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69| (mod v_~main$tmp_guard0~0_184 256)) (= v_~weak$$choice2~0_183 |v_ULTIMATE.start_main_#t~nondet29#1_155|) (= 2 v_~x~0_122) (= v_~y$w_buff0_used~0_552 (ite .cse2 .cse17 (ite (or .cse9 .cse13 .cse18) .cse17 (ite .cse19 0 .cse17)))) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem25#1_189| |v_ULTIMATE.start_main_#t~mem25#1_191|))) (or (and (or (and .cse20 (= v_~y$w_buff1~0_350 |v_ULTIMATE.start_main_#t~ite26#1_188|) .cse21 .cse22) (and (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~mem25#1_189|) (= (select .cse0 |v_~#y~0.offset_325|) |v_ULTIMATE.start_main_#t~mem25#1_189|) (or .cse23 .cse24))) (or .cse25 .cse26) (= |v_ULTIMATE.start_main_#t~ite26#1_188| 2)) (and .cse20 (= 2 v_~y$w_buff0~0_335) .cse27 (= |v_ULTIMATE.start_main_#t~ite26#1_188| |v_ULTIMATE.start_main_#t~ite26#1_190|) .cse28))) (= v_~y$mem_tmp~0_141 2) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~main$tmp_guard0~0_184 (ite (= (ite (= v_~__unbuffered_cnt~0_1011 4) 1 0) 0) 0 1)) |v_ULTIMATE.start_main_#t~short38#1_253|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_553, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_230|, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_191|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_227|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_217, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_200|, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_190|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_155|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~y$w_buff1~0=v_~y$w_buff1~0_350, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_145|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_310, #memory_int=|v_#memory_int_739|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_307, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_143|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_90|, ~#y~0.offset=|v_~#y~0.offset_325|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_552, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_81|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_325|, ULTIMATE.start_main_#t~short38#1=|v_ULTIMATE.start_main_#t~short38#1_252|, ~y$mem_tmp~0=v_~y$mem_tmp~0_141, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_216, ~weak$$choice1~0=v_~weak$$choice1~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_83|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_134|, ~y$flush_delayed~0=v_~y$flush_delayed~0_163, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_144, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_153|, ULTIMATE.start_main_#t~ite27#1=|v_ULTIMATE.start_main_#t~ite27#1_146|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_184, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_143, ~weak$$choice0~0=v_~weak$$choice0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~pre23#1=|v_ULTIMATE.start_main_#t~pre23#1_121|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_309, #memory_int=|v_#memory_int_738|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1011, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_107|, ~weak$$choice2~0=v_~weak$$choice2~0_183, ~x~0=v_~x~0_122, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_306, ULTIMATE.start_main_#t~mem37#1=|v_ULTIMATE.start_main_#t~mem37#1_159|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[|v_ULTIMATE.start_main_#t~ite40#1_154|, |v_ULTIMATE.start_main_#t~short38#1_254|, |v_ULTIMATE.start_main_#t~short38#1_253|, |v_ULTIMATE.start_main_#t~mem25#1_189|, |v_ULTIMATE.start_main_#t~mem34#1_228|, |v_ULTIMATE.start_main_#t~ite35#1_225|, |v_ULTIMATE.start_main_#t~ite26#1_188|, |v_ULTIMATE.start_main_#t~mem39#1_198|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem30#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~short38#1, ULTIMATE.start_main_#t~mem25#1, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ~y$flush_delayed~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite27#1, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet29#1, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~pre23#1, ULTIMATE.start_main_#t~nondet33#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~nondet24#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem37#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-13 09:35:46,409 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 09:35:46,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22840 [2022-12-13 09:35:46,410 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 632 flow [2022-12-13 09:35:46,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 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 09:35:46,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:35:46,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:46,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:35:46,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 09:35:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:35:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash 257864587, now seen corresponding path program 1 times [2022-12-13 09:35:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:35:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712803771] [2022-12-13 09:35:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:35:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:35:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:35:46,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:35:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:35:46,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:35:46,539 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:35:46,540 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 09:35:46,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 09:35:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 09:35:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 09:35:46,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 09:35:46,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:35:46,542 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:35:46,546 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:35:46,546 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:35:46,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:35:46 BasicIcfg [2022-12-13 09:35:46,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:35:46,639 INFO L158 Benchmark]: Toolchain (without parser) took 66088.27ms. Allocated memory was 127.9MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 101.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 09:35:46,639 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:35:46,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.18ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 101.7MB in the beginning and 162.6MB in the end (delta: -60.9MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2022-12-13 09:35:46,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.64ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 160.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:35:46,639 INFO L158 Benchmark]: Boogie Preprocessor took 25.55ms. Allocated memory is still 188.7MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:35:46,640 INFO L158 Benchmark]: RCFGBuilder took 857.17ms. Allocated memory is still 188.7MB. Free memory was 157.4MB in the beginning and 122.8MB in the end (delta: 34.6MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. [2022-12-13 09:35:46,640 INFO L158 Benchmark]: TraceAbstraction took 64632.32ms. Allocated memory was 188.7MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 121.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-13 09:35:46,641 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 127.9MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 519.18ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 101.7MB in the beginning and 162.6MB in the end (delta: -60.9MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.64ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 160.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.55ms. Allocated memory is still 188.7MB. Free memory was 160.0MB in the beginning and 157.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 857.17ms. Allocated memory is still 188.7MB. Free memory was 157.4MB in the beginning and 122.8MB in the end (delta: 34.6MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. * TraceAbstraction took 64632.32ms. Allocated memory was 188.7MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 121.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7s, 136 PlacesBefore, 48 PlacesAfterwards, 124 TransitionsBefore, 36 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2071, independent: 1963, independent conditional: 1963, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1406, independent conditional: 0, independent unconditional: 1406, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1458, independent: 1406, independent conditional: 0, independent unconditional: 1406, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1458, independent: 1339, independent conditional: 0, independent unconditional: 1339, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 119, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 389, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 331, dependent conditional: 0, dependent unconditional: 331, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2071, independent: 557, independent conditional: 557, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 1458, unknown conditional: 1458, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1406, Positive conditional cache size: 1406, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 282, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 250, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 250, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 264, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 282, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 250, unknown conditional: 250, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 224, Positive conditional cache size: 224, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 47, independent conditional: 14, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, independent: 47, independent conditional: 14, independent unconditional: 33, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 55, unknown conditional: 55, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 271, Positive conditional cache size: 271, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 152, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 280, Positive conditional cache size: 280, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 7, independent unconditional: 6, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 7, independent unconditional: 6, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 293, Positive conditional cache size: 293, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 13, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 13, independent unconditional: 12, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 151, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 318, Positive conditional cache size: 318, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 13, independent unconditional: 25, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 13, independent unconditional: 25, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 24, dependent conditional: 1, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 356, Positive conditional cache size: 356, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 956 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 361, Positive conditional cache size: 361, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 17, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 361, Positive conditional cache size: 361, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 371, Positive conditional cache size: 371, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 65 PlacesBefore, 65 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 376, Positive conditional cache size: 376, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 68 PlacesBefore, 68 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 37, independent conditional: 33, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 37, independent conditional: 33, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 413, Positive conditional cache size: 413, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.7s, 69 PlacesBefore, 65 PlacesAfterwards, 77 TransitionsBefore, 67 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 366, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 366, independent: 252, independent conditional: 252, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 73, unknown conditional: 73, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 485, Positive conditional cache size: 485, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2161; [L852] FCALL, FORK 0 pthread_create(&t2161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2161, ((void *)0), P0, ((void *)0))=-3, t2161={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t2162; [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] EXPR 1 \read(y) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L768] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L769] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L770] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L771] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L772] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L774] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L777] EXPR 1 \read(y) [L777] 1 __unbuffered_p0_EAX = y [L778] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L778] 1 y = y$flush_delayed ? y$mem_tmp : y [L779] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] FCALL, FORK 0 pthread_create(&t2162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2162, ((void *)0), P1, ((void *)0))=-2, t2161={6:0}, t2162={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t2163; [L794] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t2163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2163, ((void *)0), P2, ((void *)0))=-1, t2161={6:0}, t2162={7:0}, t2163={8:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y = 1 [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] 0 pthread_t t2164; [L858] FCALL, FORK 0 pthread_create(&t2164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2164, ((void *)0), P3, ((void *)0))=0, t2161={6:0}, t2162={7:0}, t2163={8:0}, t2164={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 4 y = 2 [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 \read(y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 4 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 4 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 4 !(!cond) [L862] RET 4 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 4 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 4 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 4 \read(y) [L864] EXPR 4 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 4 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 4 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 4 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 4 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 4 y$flush_delayed = weak$$choice2 [L874] EXPR 4 \read(y) [L874] 4 y$mem_tmp = y [L875] EXPR 4 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] EXPR 4 \read(y) [L875] EXPR 4 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 4 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 4 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 4 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 4 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 4 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 4 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 4 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 4 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 4 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 4 \read(*__unbuffered_p0_EAX$read_delayed_var) [L883] EXPR 4 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L883] EXPR 4 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 4 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 4 x == 2 && y == 2 [L884] EXPR 4 \read(y) [L884] EXPR 4 x == 2 && y == 2 [L884] 4 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L885] EXPR 4 y$flush_delayed ? y$mem_tmp : y [L885] 4 y = y$flush_delayed ? y$mem_tmp : y [L886] 4 y$flush_delayed = (_Bool)0 [L888] CALL 4 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 5 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: 64.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 609 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 609 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 911 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 5 mSDtfsCounter, 911 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=12, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:35:46,679 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...